Submission #1243928

#TimeUsernameProblemLanguageResultExecution timeMemory
1243928emad234Financial Report (JOI21_financial)C++20
48 / 100
4094 ms2396 KiB
#include "bits/stdc++.h"
#define F first
#define S second
#define ll long long
#define pii pair<int,int>
const int mxN = 3e5 + 5;
const int mod = 1e9 + 7;
using namespace std;
int dp[mxN];
int a[mxN];
int n,d;
int t[mxN];
signed main(){
  cin >>n>>d;
  for(int i = 1;i <= n;i++) cin >>a[i];
  int ans = 0;
  for(int i = 1;i <= n;i++){
    dp[i] = 1;
    t[i] = i;
    for(int j = 1;j < i;j++){
      if(i - t[j] <= d){
        if(a[j] >= a[i]) t[j] = i;
        else{
          dp[i] = max(dp[i],dp[j] + 1);
        }
      }
    }
    ans = max(ans,dp[i]);
  }
  cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...