제출 #1313189

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1313189		huoi	Global Warming (CEOI18_glo)	C++17	0 / 100	24 ms	16044 KiB

glo

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

#define int long long
#define INF

struct FenwickTree {
    int n;
    vector<int> t;

    FenwickTree(int n) : n(n), t(n) {}

    int lsb(int x) {
        return x & -x;
    }

    void update(int p, int x) {
        while (p <= n) {
            t[p] = max(t[p], x);
            p += lsb(p);
        }
    }

    int query(int p) {
        int ans = 0;
        while (p > 0) {
            ans = max(ans, t[p]);
            p -= lsb(p);
        }
        return ans;
    }
};

void solve() {
    int n, x;
    cin >> n >> x;

    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    int ans = 1;
    vector<FenwickTree> ft(2, FenwickTree(200000));
    vector<vector<int>> dp(n + 1, vector<int>(2, 1));

    for (int i = 1; i <= n; i++) {
        dp[i][0] = ft[0].query(a[i] - 1) + 1;
        dp[i][1] = max(ft[0].query(a[i] - x - 1), ft[1].query(a[i] - 1)) + 1;
        ft[0].update(a[i], dp[i][0]);
        ft[1].update(a[i], dp[i][1]);
        ans = max(ans, max(dp[i][0], dp[i][1]));
    }

    cout << ans;
}

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

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 17
• Subtask 7: 0 / 25