Submission #908633

#	Time	Username	Problem	Language	Result	Execution time	Memory
908633		Trisanu_Das	Financial Report (JOI21_financial)	C++17	0 / 100	4102 ms	5972 KiB

Main

#include <bits/stdc++.h>
using namespace std;
 
int n, d, a[300005], memo[300005];
 
int dp(int i){
  if(i == n) return 1;
  if(memo[i] != -1) return memo[i];
  memo[i] = 0; int l = i;
  for(int j = i + 1; j - l <= d && j <= n; j++){
    if(a[j] <= a[i]) l = j;
    else memo[i] = max(memo[i], dp(j));
  }
  memo[i]++;
  return memo[i];
}
 
int main(){
  ios_base::sync_with_stdio(false); cin.tie(NULL);
  cin >> n >> d;
  for(int i = 1; i <= n; i++) cin >> a[i];
  memset(memo, -1, sizeof(memo));
  int ans = 0;
  for(int i = 0; i <= n; i++) ans = max(ans, dp(i));
  cout << ans << '\n';
}

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