Submission #427419

#	Time	Username	Problem	Language	Result	Execution time	Memory
427419		DanerZein	Financial Report (JOI21_financial)	C++14	28 / 100	4115 ms	528792 KiB

Main

#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++){
    int val;
    if(x[i]>ma) val=1;
    else val=0;
    ans=max(ans,finan(i,max(ma,x[i]))+val);
  }
  return dp[ii(id,ma)]=ans;
}
int main(){
  cin>>n>>d;
  for(int i=0;i<n;i++){
    int a; cin>>a;
    x.push_back(a);
  }
  int ans=0;
  for(int i=0;i<n;i++){
    ans=max(ans,finan(i,x[i])+1);
  }
  cout<<ans<<endl;
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35