제출 #1181031

#제출 시각아이디문제언어결과실행 시간메모리
1181031irmuunFinancial Report (JOI21_financial)C++20
0 / 100
4096 ms7496 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() #define rall(s) s.rbegin(),s.rend() int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll n,d; cin>>n>>d; ll a[n+5]; vector<ll>ord(n); iota(all(ord),0); for(ll i=1;i<=n;i++){ cin>>a[i]; } sort(all(ord),[&](ll i,ll j){ if(a[i]!=a[j]) return a[i]>a[j]; return i<j; }); vector<ll>dp(n+5,-1e9); vector<bool>act(n+5,false); for(ll j:ord){ act[j]=true; dp[j]=1; ll last=j; for(ll i=j+1;i<=n;i++){ if(act[i]){ if(i-last<=d){ dp[j]=max(dp[j],dp[i]+1); } } else{ if(i-last<=d){ last=i; } } } } ll ans=0; for(ll i=1;i<=n;i++){ ans=max(ans,dp[i]); } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...