This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
* With a little appreciation, in a mostly hollow tone, she says, "Delightful." As if the world has any meaning.
* TASK : Global Warming
* AUTHOR : Marszpace
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,x;
cin >> n >> x;
vector<int> arr(n);
for(int i=0;i<n;i++){
cin >> arr[i];
}
vector<int> lis,len,tail;
for(int i=0;i<n;i++){
int idx;
if(lis.empty()||lis.back()<arr[i]){
idx=lis.size();
lis.push_back(arr[i]);
}
else{
idx=lower_bound(lis.begin(),lis.end(),arr[i])-lis.begin();
lis[idx]=arr[i];
}
tail.push_back(idx);
arr[i]=-1*arr[i];
}
int res=lis.size();
lis.clear();
for(int i=n-1;i>=1;i--){
if(lis.empty()||lis.back()<arr[i]){
lis.push_back(arr[i]);
}
else{
int idx=lower_bound(lis.begin(),lis.end(),arr[i])-lis.begin();
lis[idx]=arr[i];
}
res=max(res,(int)lis.size()+tail[i-1]);
}
cout << res;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |