Submission #503422

#	Time	Username	Problem	Language	Result	Execution time	Memory
503422		DanerZein	Financial Report (JOI21_financial)	C++14	0 / 100	4081 ms	88896 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,ll> ii;
const int MAX_N=3e5+10;
vector<ll> x;
int n,d;
map<ii,int> dp;

int report(int id,ll ma){
  if(dp.find(ii(id,ma))!=dp.end())
    return dp[ii(id,ma)];
  if(id==n) return 0;
  int r;
  if(id==0) r=n;
  else r=min(n,id+d);
  int ans=0;
  for(int i=id+1;i<=r;i++){
    ll nma=max(ma,x[i]);
    bool sw=(x[i]>ma);
    ans=max(ans,report(i,nma)+sw);
  }
  return dp[ii(id,ma)]=ans;
}

int main(){
  cin>>n>>d;
  x.push_back(0);
  for(int i=0;i<n;i++){
    ll a; cin>>a;
    x.push_back(a);
  }
  cout<<report(0,0)<<endl;
}

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