# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
395821 | 2021-04-29T02:50:25 Z | Qw3rTy | Global Warming (CEOI18_glo) | C++11 | 19 ms | 1380 KB |
#include <bits/stdc++.h> #define INF 1e9+5 #define pb push_back using namespace std; const int maxN = 1e5+5; int a[maxN]; int f[maxN]; //length of LIS that ends on a[i] int g[maxN]; //Length of longest decreasing subsequence that ends at a[i] int N,d; bool cmp(const int &a, const int &b){return a > b;} 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]; //Calculate f f[0] = 0; vector<int> dp; for(int i = 1; i <= N; ++i){ int pos = lower_bound(dp.begin(),dp.end(),a[i]) - dp.begin(); if(pos == dp.size()) dp.pb(a[i]); else dp[pos] = a[i]; f[i] = dp.size(); } //Calculate g g[N+1] = 0; dp.clear(); for(int i = N; i >= 1; --i){ int pos = lower_bound(dp.begin(),dp.end(),a[i],cmp) - dp.begin(); if(pos == dp.size()) dp.pb(a[i]); else dp[pos] = i; g[i] = dp.size(); } //Calculate answer int res = 0; for(int i = 0; i <= N; ++i){ if(a[i] - d < a[i+1]){ res = max(res, f[i] + g[i+1]); } } cout << res << '\n'; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 13 ms | 1228 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 10 ms | 888 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 19 ms | 1380 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |