제출 #1275877

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1275877		quanduongxuan12	Global Warming (CEOI18_glo)	C++20	27 / 100	68 ms	4452 KiB

glo

#include <bits/stdc++.h>
using namespace std;
#define name "warming"
#define MAXN 200005
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<int, int>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
    u+=v;
    if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
    u-=v;
    if (u<0) u+=MOD;
}
void minimize(int &u, int v){
    u=min(u,v);
}
void maximize(int &u, int v){
    u=max(u,v);
}
long long Rand(long long l, long long r){
    ll tmp=0;
    FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
    return l+tmp%(r-l+1);
}
int n,d;
int a[MAXN];
vector<int> store;
int bit[MAXN];
void update0(int x, int val){
    for (; x<MAXN; x+=x&-x) maximize(bit[x],val);
}
int get0(int x){
    int res=0;
    for (; x>0; x-=x&-x) maximize(res,bit[x]);
    return res;
}
void update1(int x, int val){
    for (; x>0; x-=x&-x) maximize(bit[x],val);
}
int get1(int x){
    int res=0;
    for (; x<MAXN; x+=x&-x) maximize(res,bit[x]);
    return res;
}
int le[MAXN],ri[MAXN];
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin>>n>>d;
    FOR(i,1,n) cin>>a[i];
    FOR(i,1,n) store.pb(a[i]);
    sort(all(store));
    uni(store);
    FOR(i,1,n) a[i]=lower_bound(all(store),a[i])-store.begin()+1;
    FOR(i,1,n){
        le[i]=get0(a[i])+1;
        update0(a[i]+1,le[i]);
    }
    memset(bit,0,sizeof(bit));
    FORD(i,n,1){
        ri[i]=get1(a[i]+1)+1;
        update1(a[i],ri[i]);
    }
    memset(bit,0,sizeof(bit));
    int res=0;
    FOR(i,1,n){
        int x=lower_bound(all(store),a[i]+d)-store.begin();
        maximize(res,get0(x)+ri[i]);
        update0(a[i],le[i]);
    }
    cout<<res;
    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