Submission #416211

#TimeUsernameProblemLanguageResultExecution timeMemory
416211duyanh1704Global Warming (CEOI18_glo)C++14
100 / 100
77 ms10076 KiB
#include <bits/stdc++.h> #define int long long using namespace std; const int inf = 1e17 + 29; int n, x, res; vector<int> a; vector<int> LIS(vector<int> a, int t, int d){ vector<int> f(n + 5, inf); f[0] = -inf; vector<int> dp(n, 0); for (int i = 0; i < n; ++i){ int k = lower_bound(f.begin(), f.end(), t * a[i] + d) - f.begin(); dp[i] = k; k = lower_bound(f.begin(), f.end(), t * a[i]) - f.begin(); f[k] = t * a[i]; } return dp; } signed main(){ ios::sync_with_stdio(0); cin.tie(0); cin >> n >> x; for (int i = 1; i <= n; ++i){ int t; cin >> t; a.push_back(t); } vector<int> f = LIS(a, 1, 0); reverse(a.begin(), a.end()); vector<int> g = LIS(a, -1, x); reverse(g.begin(), g.end()); for (int i = 0; i < n; ++i) res = max(res, f[i] + g[i] - 1); cout << res; }
#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...