제출 #1322404

#제출 시각아이디문제언어결과실행 시간메모리
1322404neonglitchFinancial Report (JOI21_financial)C++20
48 / 100
4094 ms2732 KiB
#include <iostream> using namespace std; const int N=3e5+10; int a[N],dp[N]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,d; cin>>n>>d; for(int i=1;i<=n;i++)cin>>a[i],dp[i]=1; for(int i=1;i<=n;i++) { int cu=0; for(int j=i-1;j>=1;j--) { if(a[j]>=a[i]) { cu++; } else { if(cu>=d) { break; } cu=0; dp[i]=max(dp[i],dp[j]+1); } } } int ans=0; for(int i=1;i<=n;i++) { ans=max(ans,dp[i]); } cout<<ans<<endl; }
#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...