# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
785442 | makanhulia | Global Warming (CEOI18_glo) | C++17 | 0 ms | 0 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<bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, x, ans; cin >> n >> x;
if(x==0) {
vector<int> a(n); for(int &p : a) cin >> p;
vector<int> dp; int ans=1;
for(int p : a) {
auto it=lower_bound(dp.begin(), dp.end(), p);
if(it==dp.end()) dp.push_back(p);
else *it=p;
}
ans=dp.size();
} else if(x<=5 && n<=50000) {
while(n--) {
int p; cin >> p;
vector<int> tempaa=a;
auto it=lower_bound(tempaa.begin(), tempaa.end(), p);
if(it==tempaa.end()) tempaa.push_back(p);
else *it=p;
vector<int> tempba=b;
it=lower_bound(tempba.begin(), tempba.end(), p);
if(it==tempba.end()) tempba.push_back(p);
else *it=p;
if(tempaa.size()>tempba.size()) a=tempaa;
else a=tempba; p-=x;
it=lower_bound(b.begin(), b.end(), p);
if(it==b.end()) b.push_back(p);
else *it=p;
}
ans=max(a.size(), b.size());
} else {
vector<int> a(n); for(int &p : a) cin >> p;
vector<int> dp; int ans=1;
for(int i=0; i<n; i++) {
dp.clear();
vector<int> temp=a;
for(int k=i; k<n; k++) temp[k]+=x;
for(int p : temp) {
auto it=lower_bound(dp.begin(), dp.end(), p);
if(it==dp.end()) dp.push_back(p);
else *it=p;
}
ans=max(ans, (int)dp.size());
}
}
cout << ans << '\n';
return 0;
}