Submission #1304785

#TimeUsernameProblemLanguageResultExecution timeMemory
1304785dbekarysFinancial Report (JOI21_financial)C++20
0 / 100
4093 ms7388 KiB
#include <bits/stdc++.h> #define int long long #define pll pair<int,int> #define endl '\n' using namespace std; const int MOD2=998244353; const int MOD1=1e9+7; const int N=3e5+7; const int LOG=20; const long long inf=8e18+7; int dp[N],mx[N]; signed main() { ios_base::sync_with_stdio(0), cin.tie(0); int n,d; cin>> n>>d; int a[n]; for(int i=0;i<n;i++){ cin>> a[i]; } for(int i=0;i<n;i++){ dp[i]=1; for(int j=max(0ll,i-d-1);j<i;j++){ int c=0; if(dp[i]<=dp[j]+(a[i]>mx[j])){ c=max(mx[j],a[i]); } dp[i]=max(dp[i],dp[j]+(a[i]>mx[j])); mx[i]=max(mx[i],c); } } cout<< dp[n-1]+1; }
#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...