Submission #260509

#	Time	Username	Problem	Language	Result	Execution time	Memory
260509		stefantaga	Global Warming (CEOI18_glo)	C++14	28 / 100	2099 ms	3448 KiB

glo

#include <bits/stdc++.h>

using namespace std;
int n,x,i,v[200005],b[200005],poz,lcresc[200005],ldesc[200005],j,maxim;
int caut (int val)
{
    int st=1,dr=n,mij,sol=0;
    while (st<=dr)
    {
        mij=(st+dr)/2;
        if (b[mij]<val)
        {
            sol=mij;
            st=mij+1;
        }
        else
        {
            dr=mij-1;
        }
    }
    return sol;
}
int caut1 (int val)
{
    int st=1,dr=n,mij,sol=0;
    while (st<=dr)
    {
        mij=(st+dr)/2;
        if (b[mij]<=val)
        {
            sol=mij;
            st=mij+1;
        }
        else
        {
            dr=mij-1;
        }
    }
    return sol;
}
int main()
{
    #ifdef HOME
    ifstream cin("date.in");
    ofstream cout("date.out");
    #endif // HOME
    cin>>n>>x;
    for (i=1;i<=n;i++)
    {
        b[i]=2000000005;
    }
    for (i=1;i<=n;i++)
    {
        cin>>v[i];
        poz=caut(v[i]);
        if (v[i]<b[poz+1])
        {
            b[poz+1]=v[i];
            lcresc[i]=poz+1;
        }
    }
    for (i=1;i<=n;i++)
    {
        b[i]=-2000000005;
    }
    for (i=n;i>=1;i--)
    {
        poz=caut1(v[i]);
        if (v[i]>b[poz])
        {
            b[poz]=v[i];
            ldesc[i]=n-poz+1;
        }
    }
    maxim=1;
    for (i=1;i<=n;i++)
    {
        for (j=i-1;j>=1;j--)
        {
             if (v[j]-x<v[i])
             {
                 maxim=max(maxim,ldesc[i]+lcresc[j]);
             }
        }
    }
    cout<<maxim<<'\n';
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 13 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 17
• Subtask 7: 0 / 25