# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
982568 | SmuggingSpun | Global Warming (CEOI18_glo) | C++14 | 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 taskname "glo"
using namespace std;
typedef long long ll;
template<class T>void maximize(T& a, T b){
if(a < b){
a = b;
}
}
const int lim = 2e5 + 5;
const int INF = 2e9 + 1;
int n, X, a[lim];
namespace sub12{
void solve(){
int ans = 0;
for(int i = 1; i <= n; i++){
for(int j = i; j <= n; j++){
for(int d = -X; d <= X; d++){
vector<int>t(n + 1), f(n + 1, INF);
for(int k = 1; k <= n; k++){
t[k] = a[k];
}
for(int k = i; k <= j; k++){
t[k] += d;
}
f[0] = -INF;
for(int k = 1; k <= n; k++){
int low = 0, high = n - 1, p;
while(low <= high){
int mid = (low + high) >> 1;
if(f[mid] < t[k]){
low = (p = mid) + 1;
}
else{
high = mid - 1;
}
}
f[++p] = t[k];
maximize(ans, p);
}
}
}
}
cout << ans;
}
}
namespace sub4{
void solve(){
vector<int>f(n + 1, INF);
f[0] = -INF;
int ans = 0;
for(int k = 1; k <= n; k++){
int low = 0, high = n - 1, p;
while(low <= high){
int mid = (low + high) >> 1;
if(f[mid] < a[k]){
low = (p = mid) + 1;
}
else{
high = mid - 1;
}
}
f[++p] = t[k];
maximize(ans, p);
}
cout << ans;
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> n >> X;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
if(n <= 50){
sub12::solve();
}
else if(X == 0){
sub4::solve();
}
}