Submission #601613

#TimeUsernameProblemLanguageResultExecution timeMemory
601613pakhomoveeGlobal Warming (CEOI18_glo)C++17
0 / 100
2071 ms3420 KiB
#include <iostream> #include <vector> #include <algorithm> #include <set> #include <map> using namespace std; const int inf = 1e9 + 10; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, x; cin >> n >> x; vector<int> a(n); for (int& i : a) { cin >> i; } vector<int> p(n + 1, inf); vector<int> mx(n + 1, 0); vector<int> dp(n, 0); p[0] = -inf; for (int i = 0; i < n; ++i) { int id = upper_bound(p.begin(), p.end(), a[i]) - p.begin(); if (p[id - 1] < a[i]) p[id] = a[i]; dp[i] = id; } int ans = 0; for (int& i : a) i = -i; p.assign(n + 1, inf); p[0] = -inf; for (int i = n - 1; i >= 0; --i) { int id = upper_bound(p.begin(), p.end(), a[i]) - p.begin(); if (p[id - 1] < a[i]) p[id] = a[i]; for (int j = i - 1; j >= 0; --j) { if (a[i] - a[j] < x) { ans = max(ans, dp[j] + id); } } } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...