Submission #1095607

#	Time	Username	Problem	Language	Result	Execution time	Memory
1095607		TrinhKhanhDung	Global Warming (CEOI18_glo)	C++14	100 / 100	44 ms	5492 KiB

glo

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18 + 10
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 2e5 + 10;

int N, X;
int a[MAX], L[MAX], R[MAX];

void solve(){
    cin >> N >> X;
    for(int i = 1; i <= N; i++) cin >> a[i];

    vector<int> len(N + 3, INF);
    for(int i = 1; i <= N; i++){
        int p = lower_bound(ALL(len), a[i]) - len.begin();
        L[i] = p + 1;
        len[p] = a[i];
    }

    len = vector<int>(N + 3, INF);
    for(int i = N; i >= 1; i--){
        int p = lower_bound(ALL(len), - a[i] + X) - len.begin();
        R[i] = p + 1;
        p = lower_bound(ALL(len), - a[i]) - len.begin();
        len[p] = - a[i];
    }

    int ans = 0;
    for(int i = 1; i <= N; i++) maximize(ans, L[i] + R[i] - 1);

    cout << ans << '\n';
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//     freopen("bdbang.inp","r",stdin);
//     freopen("bdbang.out","w",stdout);

    int t = 1;
//    cin >> t;
    while(t--)
        solve();

    return 0;
}

• 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