# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
968827 | vjudge1 | Global Warming (CEOI18_glo) | C++17 | 2066 ms | 3164 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> dp;
int lis(int tt[],int n,int a,int b,int x){
int t[n+1];
for(int i=1;i<=n;++i) t[i]=tt[i];
for(int i=a;i<=b;++i){
t[i]+=x;
}
dp.clear();
for(int i=1;i<=n;++i){
int idx=lower_bound(dp.begin(),dp.end(),t[i])-dp.begin();
if(idx==dp.size()) dp.push_back(t[i]);
else dp[idx]=t[i];
}
return dp.size();
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int n,x; cin >> n >> x;
int t[n+1];
for(int i=1;i<=n;++i) cin >> t[i];
int maxi=0;
for(int p=-abs(x);p<=abs(x);++p){
for(int s=1;s<=n;++s){
for(int e=s;e<=n;++e){
//cout << s << " " << e << " " << p << " " << lis(t,n,s,e,p) << endl;
maxi=max(lis(t,n,s,e,p),maxi);
}
}
}
cout << maxi;
}
Compilation message (stderr)
# | 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... |