Submission #1287635

#TimeUsernameProblemLanguageResultExecution timeMemory
1287635paulxaxaGlobal Warming (CEOI18_glo)C++17
38 / 100
2096 ms1892 KiB
#include <bits/stdc++.h>



#define NMAX 200000
#define LOG 19
#define ll long long int
#define MOD 30103
#define INF (ll)1e13

using namespace std;

ifstream fin("cod.in");
ofstream fout("cod.out");

int n,x;
int a[NMAX+1];

int dp[NMAX+1];
int solve_lis()
{
    for(int i=1;i<=n;i++)
    {
        dp[i]=0;
    }
    int l=0;
    for(int i=1;i<=n;i++)
    {
        int st=1,dr=l;
        while(st<=dr)
        {
            int m = (st+dr)/2;
            if(dp[m] < a[i])
            {
                st=m+1;
            }
            else
            {
                dr=m-1;
            }
        }
        if(dr==l)
        {
            dp[++l] = a[i];
        }
        else
        {
            dp[dr+1] = a[i];
        }
    }
    return l;
}
int main()
{
    cin >> n >> x;
    for(int i=1;i<=n;i++)
    {
        cin >> a[i];
    }
    int res = solve_lis();
    for(int i=1;i<=n && x;i++)
    {
        a[i] -= x;
        res=max(res, solve_lis());
    }
    cout << res;
}




#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...