Submission #739522

#TimeUsernameProblemLanguageResultExecution timeMemory
739522Dan4LifeGlobal Warming (CEOI18_glo)C++17
100 / 100
56 ms2400 KiB
#include <bits/stdc++.h> using namespace std; #define all(a) a.begin(),a.end() const int mxN = (int)2e5+10; int n, x, a[mxN], l[mxN]; vector<int> v; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> x; int ans = 0; for(int i = 0; i < n; i++) cin >> a[i]; for(int i = 0; i < n; i++) { auto itr = lower_bound(all(v),a[i]); l[i] = itr-begin(v)+1; ans = max(ans, l[i]); if (itr!=end(v)) *itr = a[i]; else v.push_back(a[i]); } v.clear(); for(int i = n-1; i >= 0; i--){ a[i]=-a[i]-x; auto itr = lower_bound(all(v),a[i]); int xd = lower_bound(all(v),a[i]+x)-begin(v); ans = max(ans, l[i]+xd); if (itr!=end(v)) *itr = a[i]; else v.push_back(a[i]); } 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...