This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define i64 long long
#define mp make_pair
#define all(x) (x).begin(), (x).end()
const int MAXN = 300005;
const int INF = 1e9 + 7;
int N, D, a[MAXN], f[MAXN];
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> N >> D;
for (int i = 1; i <= N; i ++) cin >> a[i];
stack<int> s; s.push(N + 1); a[N + 1] = INF;
int ans = 0;
for (int i = N; i >= 1; i --) {
for (int j = i + 1; j <= min(j + D, N + 1); j ++) {
f[i] = max(f[i], f[j] + (a[j] > a[i]));
}
ans = max(ans, f[i]);
}
cout << ans << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |