제출 #284370

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
284370		Revo7	Global Warming (CEOI18_glo)	C++14	27 / 100	773 ms	14248 KiB

glo

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define left 2*i+1
#define righ 2*i+2
#define mid (l+r)/2
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);


using namespace std;
const ll maxn=2e5+100;
const ll inf=1e9+10;
const ll mod=1e9+7;
const ll base=27;

int n,k,ans;
int a[maxn],st[4*maxn],pre[maxn],suf[maxn];
map<int,int>ha;

int qur(int i,int l,int r,int ql,int qr){
    if(ql>qr)return 0;
    if(r<ql||l>qr)return 0;
    if(l>=ql&&r<=qr)return st[i];
    return max(qur(left,l,mid,ql,qr),qur(righ,mid+1,r,ql,qr));
}

void upd(int i,int l,int r,int id,int val){
    if(r<id||l>id)return;
    if(l==r){
        st[i]=max(st[i],val);
        return;
    }
    upd(left,l,mid,id,val);
    upd(righ,mid+1,r,id,val);
    st[i]=max(st[left],st[righ]);
}

void clear(int i,int l,int r){
    if(l==r){
        st[i]=0;
        return;
    }
    clear(left,l,mid);
    clear(righ,mid+1,r);
    st[i]=0;
}

int main()
{
    cin>>n>>k;
    for(int i=0;i<n;i++){
        cin>>a[i];
        ha[a[i]]=1;
    }
    ha[k]=1;
    int cnt=0;
    for(auto &x:ha){
        x.second=cnt++;
    }
    k=ha[k];
    for(int i=0;i<n;i++){
        a[i]=ha[a[i]];
        pre[i]=1+qur(0,0,cnt-1,0,a[i]-1);
        upd(0,0,cnt-1,a[i],pre[i]);
        ans=max(ans,pre[i]);
    }
    //for(int i=0;i<n;i++)cout<<pre[i]<<' ';cout<<endl;

    clear(0,0,cnt-1);
    for(int i=n-1;i>=0;i--){
        suf[i]=1+qur(0,0,cnt-1,a[i]+1,cnt-1);
        upd(0,0,cnt-1,a[i],suf[i]);
        if(i){
            int cur=pre[i-1]+qur(0,0,cnt-1,max(0,a[i-1]-k+1),cnt-1);
            ans=max(ans,cur);
            //if(cur==6)cout<<i<<endl;
        }
    }

    //for(int i=0;i<n;i++)cout<<suf[i]<<' ';cout<<endl;
    cout<<ans<<endl;
    return 0;
}

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