Submission #860579

#	Time	Username	Problem	Language	Result	Execution time	Memory
860579		sysia	Global Warming (CEOI18_glo)	C++17	100 / 100	271 ms	20932 KiB

glo

//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;

struct Tree{
    vector<int>tab;
    int size = 1;

    void prep(int n){
        size = 1;
        tab.clear();
        while (size < n) size*=2;
        tab.assign(2*size, 0);
    }

    void update(int x, int v){
        x += size;
        tab[x] = max(tab[x], v);
        while (x){
            x/=2;
            tab[x] = max(tab[2*x], tab[2*x+1]);
        }
    }

    int query(int l, int r){
        int ans = 0;
        for (l += size-1, r += size+1; r-l>1; l/=2, r/=2){
            if (!(l&1)) ans = max(ans, tab[l+1]);
            if (r&1) ans = max(ans, tab[r-1]);
        }
        return ans;
    }
};

void solve(){
    int n, d; cin >> n >> d;
    vector<int>a(n+1);
    for (int i = 1; i<=n; i++) cin >> a[i];
    vector<int>suf(n+1);
    auto s = a;
    sort(s.begin(), s.end());
    s.erase(unique(s.begin(), s.end()), s.end());
    auto get = [&](int x){
        return (int)(lower_bound(s.begin(), s.end(), x) - s.begin());
    };
    Tree t; t.prep(n+2);
    for (int i = n; i>=1; i--){
        suf[i] = 1 + t.query(get(a[i])+1, n+1);
        t.update(get(a[i]), suf[i]);  
    }
    for (int i = 1; i<=n; i++){
        s.emplace_back(a[i]+d-1);
    }
    sort(s.begin(), s.end());
    s.erase(unique(s.begin(), s.end()), s.end());
    int ans = 1;
    t.prep((int)s.size()+3);
    for (int i = 1; i<=n; i++){
        int dp = 1+t.query(0, get(a[i])-1);
        ans = max(ans, suf[i] + t.query(0, get(a[i]+d-1)));
        t.update(get(a[i]), dp);
    }
    cout << ans << "\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    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