# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
819410 | SteGG | Financial Report (JOI21_financial) | C++17 | 4072 ms | 4028 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>
#define int long long
using namespace std;
void open(){
if(fopen("input.inp", "r")){
freopen("input.inp", "r", stdin);
freopen("output.out", "w", stdout);
}
}
const int maxn = 3e5 + 5;
const int inf = 1e9 + 7;
int n, d;
int arr[maxn];
int dp[maxn];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
open();
cin >> n >> d;
for(int i = 1; i <= n; i++){
cin >> arr[i];
}
deque<int> dq;
dp[1] = 1;
dq.push_back(1);
int result = 1;
for(int i = 2; i <= n; i++){
dp[i] = 1;
for(int j = 1; j < i; j++){
if(arr[j] < arr[i]){
dp[i] = max(dp[i], dp[j] + 1);
}
}
int temp = dp[i];
for(int j = 1; j < i; j++){
if(arr[j] > arr[i]){
temp = max(temp, dp[j]);
}
}
result = max(result, temp);
while(!dq.empty() && arr[dq.back()] > arr[i]) dq.pop_back();
while(!dq.empty() && i - dq.front() >= d) dq.pop_front();
dq.push_back(i);
for(int j = 1; j < i; j++){
if(arr[j] < arr[dq.front()]){
dp[j] = 0;
}
}
}
cout << result << endl;
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... |