Submission #908636

#	Time	Username	Problem	Language	Result	Execution time	Memory
908636		Trisanu_Das	Financial Report (JOI21_financial)	C++17	48 / 100	4067 ms	2912 KiB

Main

#include <bits/stdc++.h>
using namespace std;
 
int dp[300010];
int n, d;
int a[300010];
 
int solve(int i) {
	if(i==n) {
		return 1;
	}
  
	int &ret = dp[i];
	if(ret != -1){
		return ret;
	}
  
	  ret = 0;
	  int last = i;
	  for(int j=i+1; j-last<=d && j<=n; ++j) {
		  if(a[j]<=a[i]){
			  last = j;
		  }
		  else {
			  ret = max(ret, solve(j));
		  }
	  }
	  ret++;
	  return ret;
}
 
int main(){
	cin>>n>>d;
  for(int i=1; i<=n; ++i) {
    cin>>a[i];
  }
 
  memset(dp, -1, sizeof dp);
  int ans = 0;
  
  for(int i=1; i<=n; ++i) {
    ans = max(ans, solve(i));
  }
  cout<<ans;
	
}

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