Submission #1205870

#	Time	Username	Problem	Language	Result	Execution time	Memory
1205870		asli_bg	Global Warming (CEOI18_glo)	C++17	100 / 100	210 ms	16544 KiB

glo

#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long
 
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<pll> vll;
 
typedef tree<pii,null_type,less<pii>,rb_tree_tag,
tree_order_statistics_node_update> oset;
 
#define fi first
#define se second
#define pb push_back
#define pf push_front
 
#define mid (l+r)/2
#define all(x) x.begin(),x.end()
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
 
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define sp <<" "<<
 
#define DEBUG(x) cout<<(#x) sp x<<endl
#define carp(a,b) (((a%MOD)*(b%MOD))%MOD)
#define topla(a,b) (((a%MOD)+(b%MOD))%MOD)
 
const ll INF=1e18;
const int MAXN=2e5+5;
const int MOD=1e9+7;

int tut[MAXN];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n,x;
    cin>>n>>x;

    vi a(n+1);
    FORE(i,1,n+1) cin>>a[i];

    //pref
    oset pref;

    FORE(i,1,n+1){
        if(pref.empty()){
            pref.insert({a[i],i});
            tut[i]=1;
        }
        else{
            auto it=pref.lower_bound({a[i],0});
            tut[i]=pref.order_of_key({a[i],0})+1;
            if(it!=pref.end()){ 
                pref.erase(*it);
            }
            pref.insert({a[i],i});
        }
    }

    int ans=pref.size();

    //suf
    oset suf;
    int deg=1;
    for(int i=n;i>0;i--){
        if(suf.empty()){
            suf.insert({a[i]*-1,i});
            deg=1;
        }
        else{
            a[i]-=x;
            a[i]*=-1;
            auto it=suf.lower_bound({a[i],0});
            deg=suf.order_of_key({a[i],0})+1;
            a[i]*=-1;
            a[i]+=x;
            a[i]*=-1;

            it=suf.lower_bound({a[i],0});
            if(it!=suf.end()){ 
                suf.erase(*it);
            }
            suf.insert({a[i],i});
        }

        ans=max(ans,tut[i]+deg-1);
    }

    cout<<ans<<endl;
}

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