Submission #969363

#TimeUsernameProblemLanguageResultExecution timeMemory
969363vjudge1Global Warming (CEOI18_glo)C++17
17 / 100
42 ms5340 KiB
#include<bits/stdc++.h> using namespace std; #define pii pair<int,int> const int mxN = 2e5+5; int n, x, arr[mxN]; pii lis[mxN], inlis[mxN]; int last[mxN]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> x; vector<int> temp; for(int i = 1; i <= n; ++i) { cin >> arr[i]; auto itr = lower_bound(temp.begin(), temp.end(), arr[i]); if(itr == temp.end()) temp.emplace_back(arr[i]); else *itr = arr[i]; // lis[i] = {temp.size(), temp[temp.size()-1]}; lis[i] = {temp[temp.size()-1], temp.size()}; } temp.clear(); for(int i = n; i >= 1; --i) { auto itr = lower_bound(temp.begin(), temp.end(), -arr[i]); if(itr == temp.end()) temp.emplace_back(-arr[i]); else *itr = -arr[i]; // inlis[i] = {temp.size(), temp[temp.size()-1]}; inlis[i] = {temp[temp.size()-1], temp.size()}; // cout << inlis[i].first << ' ' << inlis[i].second << '\n'; } int ans = 0; for(int i = 1; i <= n; ++i) { pii t = {lis[i].first - x, i}; auto j = lower_bound(lis+i+1, lis+1+n, t) - lis; int sum = lis[i].second + inlis[j].second; if(t.first == -inlis[j].first) --sum; ans = max(ans, sum); } 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...