Submission #1008085

#	Time	Username	Problem	Language	Result	Execution time	Memory
1008085		vjudge1	Global Warming (CEOI18_glo)	C++17	0 / 100	227 ms	16868 KiB

glo

#include <bits/stdc++.h>

#define suiii ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define co cout<<
//#pragma GCC optimize("O3,Ofast,unroll-loops")
//#pragma GCC target("avx2,sse3,sse4,avx")
using namespace std;
//stuff
const ll N=exp2(ceil(log2(200000)));
ll n,x;
ll arr[1000001];
ll arr1[1000001];
ll tre[N*4][2];
ll que(ll l,ll r,ll i,ll lq,ll rq,ll type){
    if(l>rq||r<lq) return 0;
    if(r<=rq&&l>=lq){
        return tre[i][type];
    }
    ll mid=(l+r)/2;
    return max(que(l,mid,i*2,lq,rq,type),que(mid+1,r,i*2+1,lq,rq,type));
}
void upd(ll idx,ll val,ll type){
    idx+=N;
    tre[idx][type]=max(tre[idx][type],val);
    idx/=2;
    while(idx){
        tre[idx][type]=max(tre[idx*2][type],tre[idx*2+1][type]);
        idx/=2;
    }
}
void solve(){
    cin>>n>>x;
    for(int i=0;i<n;i++){
        cin>>arr[i];
        arr1[i]=arr[i];
    }
    ll mx=0;
    sort(arr1,arr1+n);
    for(int i=0;i<n;i++){
        ll idx=lower_bound(arr1,arr1+n,arr[i])-arr1;
        ll last=lower_bound(arr1,arr1+n,arr[i]+x)-arr1;
        ll val=que(0,N-1,1,0,idx,0)+1;
        ll val1=que(0,N-1,1,1,last,0)+1;
        ll val2=que(0,N-1,1,1,idx,1)+1;
        mx=max({mx,val,val1,val2});
        upd(idx,val,0);
        upd(idx,val1,1);
        upd(idx,val2,1);
    }
    co max(tre[1][0],tre[1][1]);
}

int main()
{
    suiii
    int t=1;
    // cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

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