제출 #901938

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

glo

#include <bits/stdc++.h>   
using namespace std;
const int MAX_N = 2e5 + 5, MAX_LOG_ARR = 30 + 2, MAX_ARR = 1e9;

int n, x;
int arr[MAX_N];

int l_dp[MAX_N], r_dp[MAX_N];

int segtree[4 * MAX_N * MAX_LOG_ARR]; // Test
int n_nodes;
int l_child[4 * MAX_N * MAX_LOG_ARR], r_child[4 * MAX_N * MAX_LOG_ARR];
void init() {
    for (int i = 1; i <= n_nodes; i++) {
        segtree[i] = 0;
        l_child[i] = r_child[i] = 0;
    }
    n_nodes = 1;
}
void propogate(int u) {
    if (l_child[u]) return;

    n_nodes++;
    l_child[u] = n_nodes;
    n_nodes++;
    r_child[u] = n_nodes;
}
void update(int i, int x, int u = 1, int lo = 1, int hi = MAX_ARR) {
    if (lo == hi) {
        segtree[u] = x;
        return;
    }

    propogate(u);
    int mid = (lo + hi) / 2;
    if (i <= mid) update(i, x, l_child[u], lo, mid);
    else update(i, x, r_child[u], mid + 1, hi);
    segtree[u] = max(segtree[l_child[u]], segtree[r_child[u]]);
}
int query(int l, int r, int u = 1, int lo = 1, int hi = MAX_ARR) {
    if (l <= lo && hi <= r) 
        return segtree[u];

    propogate(u);
    int mid = (lo + hi) / 2, ans = 0;
    if (l <= mid) ans = max(ans, query(l, r, l_child[u], lo, mid));
    if (r > mid) ans = max(ans, query(l, r, r_child[u], mid + 1, hi));
    return ans;
}

int main() {
    // freopen("global.in", "r", stdin);

    cin >> n >> x;
    for (int i = 1; i <= n; i++)
        cin >> arr[i];

    init();
    for (int i = 1; i <= n; i++) {
        l_dp[i] = query(1, arr[i] - 1) + 1;
        update(arr[i], l_dp[i]);
    }

    init();
    for (int i = n; i >= 1; i--) {
        r_dp[i] = query(max(arr[i] - x + 1, 1), MAX_ARR);
        update(arr[i], query(arr[i] + 1, MAX_ARR) + 1);
    }

    // for (int i = 1; i <= n; i++) {
    //     cout << i << ": " << l_dp[i] << " " << r_dp[i] << endl;
    // }

    int ans = 0;
    for (int i = 1; i <= n; i++)
        ans = max(ans, l_dp[i] + r_dp[i]);
    cout << ans << '\n';
}

• 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