# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
427423 | DanerZein | Financial Report (JOI21_financial) | C++14 | 4086 ms | 567780 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
int n,d;
vector<int> x;
map<ii,int> dp;
int finan(int id,int ma){
if(dp.find(ii(id,ma))!=dp.end()) return dp[ii(id,ma)];
if(id==n-1) return 0;
int ans=0;
for(int i=id+1;i<n && i<=id+d;i++){
ans=max(ans,finan(i,max(ma,x[i]))+(x[i]>ma));
}
return dp[ii(id,ma)]=ans;
}
int main(){
scanf("%d%d",&n,&d);
for(int i=0;i<n;i++){
int a; scanf("%d",&a);
x.push_back(a);
}
int ans=0;
for(int i=0;i<n;i++){
ans=max(ans,finan(i,x[i])+1);
}
printf("%d\n",ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |