Submission #1318650

#TimeUsernameProblemLanguageResultExecution timeMemory
1318650yus1f_mGlobal Warming (CEOI18_glo)C++20
15 / 100
2094 ms3616 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;
using namespace std;
void solve()
{
    ll n,m,num,cnt,Res,ans=-INF;
    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=-1*m;i<=m;i++)
    {
        for(int j=0;j<nums.size();j++)
        {
            for(int k=j;k<nums.size();k++)
            {
                res.clear(),Res=0;
                for(int p=j;p<=k;p++)
                {
                    nums[p]+=i;
                }
                for(int p=0;p<nums.size();p++)
                {
                    cnt=lower_bound(all(res),nums[p])-res.begin();
                    if(cnt==Res)
                    {
                        Res++,res.pb(nums[p]);
                    }
                    else
                    {
                        res[cnt]=nums[p];
                    }
                }
                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();
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...