| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1318651 | yusifm | Global Warming (CEOI18_glo) | C++20 | 0 ms | 0 KiB |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
const int sz=1000000,INF=1000000000,MOD=1000000007;
using namespace std;
void solve()
{
ll n,m,num,cnt,Res,ans=0;
cin>>n>>m;
vector<ll>nums,numsC,res;
for(int i=0;i<n;i++)
{
cin>>num;
nums.pb(num),numsC.pb(num);
}
for(int i=0;i<nums.size();i++)
{
cnt=lower_bound(all(res),nums[i])-res.begin();
if(cnt==ans)
{
ans++,res.pb(nums[i]);
}
else
{
res[cnt]=nums[i];
}
}
for(int i=0;i<nums.size();i++)
{
for(int j=i;k<nums.size();j++)
{
res.clear(),Res=0;
for(int k=i;k<=j;k++)
{
nums[k]+=m;
}
for(int k=0;k<nums.size();k++)
{
cnt=lower_bound(all(res),nums[k])-res.begin();
if(cnt==Res)
{
Res++,res.pb(nums[k]);
}
else
{
res[cnt]=nums[k];
}
}
ans=max(ans,Res),nums=numsC;
}
}
cout<<ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr),cout.tie(nullptr);
ll t=1;
//cin>>t;
while(t--)
{
solve();
}
}
