# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
395554 | Qw3rTy | Global Warming (CEOI18_glo) | C++11 | 2080 ms | 1284 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 INF 1e9+5
using namespace std;
const int maxN = 1e5+5;
int a[maxN];
int b[maxN];
int f[maxN]; //f[i] = longest decreasing subsequence of b that ends on N+1-i
int g[maxN]; //g[i] = longest increasing subsequence of a that ends on i
int N,d;
void testIO(){
freopen("../test.in","r",stdin);
return;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
//testIO();
cin >> N >> d;
for(int i = 1; i <= N; ++i)cin >> a[i];
for(int i = 1; i <= N; ++i)b[i] = a[N+1-i];
b[0] = INF;
for(int i = 1; i <= N; ++i){
for(int j = 0; j < i; ++j){
if(b[i] < b[j])f[i] = max(f[i],f[j]+1);
}
}
a[0] = -INF;
for(int i = 1; i <= N; ++i){
for(int j = 0; j < i; ++j){
if(a[i] > a[j])g[i] = max(g[i],g[j]+1);
}
}
int res = 0;
for(int i = 1; i <= N; ++i){
if(a[i-1] - d <= a[i])res = max(res, g[i-1] + f[N+1-i]);
}
cout << res << '\n';
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |