제출 #313754

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
313754		jainbot27	Global Warming (CEOI18_glo)	C++17	100 / 100	64 ms	6644 KiB

glo

#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

int n; ll ans = 1; ll x, v[mxN], lst[mxN];
vi l, r; 
int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> x;
    F0R(i, n) cin >> v[i];
    F0R(i, n){
        if(siz(l))
            lst[i] = lower_bound(all(l), v[i] + x)-l.begin();
        else 
            lst[i]  = 0;
        int cur;
        if(siz(l))
            cur = lower_bound(all(l), v[i]) - l.begin();
        else 
            cur = 0;
        if(cur == siz(l)) l.pb(v[i]);
        else l[cur] = v[i];
    }
    R0F(i, n){
        //trav(x, r){
        //    cout << x << ' ';
        //}
        //cout << endl;
        //auto pos = lower_bound(all(r), -v[i]);
        //if(pos == r.end()) {
        //    r.pb(-v[i]);
        //    ckmax(ans, lst[i] + 1);
        //    continue;
        //}
        //*pos = -v[i];
        //ckmax(ans, pos - r.begin() + lst[i] + 1);
        int cur;
        if(siz(r)) cur = lower_bound(all(r), -v[i]) - r.begin();
        else cur = 0;
        if(cur == siz(r)) r.pb(-v[i]);
        else r[cur] = -v[i];
        ckmax(ans, lst[i] + cur + 1);
    }
    cout << ans << nl;
    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