# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
423434 | qwerasdfzxcl | Financial Report (JOI21_financial) | C++14 | 4034 ms | 2644 KiB |
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>
typedef long long ll;
using namespace std;
int a[300300], dp[300300];
int main(){
int n, k;
scanf("%d %d", &n, &k);
for (int i=0;i<n;i++) scanf("%d", a+i);
int ans = 1;
for (int i=n-1;i>=0;i--){
int j = i+1, mx = 0, idx = i;
while(j<n){
int nxt = idx;
for (;j<n && j<=idx+k;j++){
if (a[j]>a[i]) mx = max(mx, dp[j]);
else nxt = j;
}
if (nxt==idx) break;
}
dp[i] = mx+1;
ans = max(ans, dp[i]);
}
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | 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... |