Submission #827735

#	Time	Username	Problem	Language	Result	Execution time	Memory
827735		bachhoangxuan	Global Warming (CEOI18_glo)	C++17	100 / 100	139 ms	13388 KiB

glo

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int n,x,a[maxn];
struct BIT{
    int bit[2*maxn];
    BIT(){memset(bit,0,sizeof(bit));}
    void update(int x,int val){
        for(int i=x;i<=2*n;i+=(i&(-i))) bit[i]=max(bit[i],val);
    }
    int query(int x){
        int res=0;
        for(int i=x;i>=1;i-=(i&(-i))) res=max(res,bit[i]);
        return res;
    }
}d0,d1;

void solve(){
    cin >> n >> x;
    vector<int> com;
    for(int i=1;i<=n;i++){
        cin >> a[i];
        com.push_back(a[i]);
        com.push_back(a[i]+x);
    }
    sort(com.begin(),com.end());
    com.erase(unique(com.begin(),com.end()),com.end());
    auto get_pos = [&](int x){
        return lower_bound(com.begin(),com.end(),x)-com.begin()+1;
    };
    int ans=0;
    for(int i=1;i<=n;i++){
        int p0=get_pos(a[i]),p1=get_pos(a[i]+x);
        int dp0=d0.query(p0-1)+1;
        int dp1=max(d1.query(p0-1),d0.query(p1-1))+1;
        d0.update(p0,dp0);d1.update(p0,dp1);
        ans=max({ans,dp0,dp1});
    }
    cout << ans << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

• 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