Box Stack II

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

string to_string(string s) {
    return '"' + s + '"';
}
 
string to_string(const char* s) {
    return to_string((string) s);
}
 
string to_string(bool b) {
    return (b ? "true" : "false");
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
    return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A>
string to_string(A v) {
    bool first = true;
    string res = "{";
    for (const auto &x : v) {
        if (!first) {
            res += ", ";
        }
        first = false;
        res += to_string(x);
    }
    res += "}";
    return res;
}
 
void debug_out() {
    cerr << endl;
}
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

const int N = 2e5 + 5;
const int INF = 1e9 + 5;

int n, sz, x[N], y[N], z[N], dp[N];
vector<int> cx, cy;
vector<vector<int>> nodes;
vector<vector<long long>> bit;
vector<array<int, 3>> items;

void fakeupd(int i, int j) {
    for (int ii = i; ii <= sz; ii += ii & -ii) {
        nodes[ii].push_back(j);
    }
}

void upd(int i, int j, int v) {
    for (int ii = i; ii <= sz; ii += ii & -ii) {
        for (int jj = lower_bound(nodes[ii].begin(), nodes[ii].end(), j) - nodes[ii].begin() + 1; jj <= (int)nodes[ii].size(); jj += jj & -jj) {
            bit[ii][jj] = max(bit[ii][jj], v);
        }
    }
}

long long que(int i, int j) {
    long long res = 0;
    for (int ii = i; ii >= 1; ii -= ii & -ii) {
        for (int jj = upper_bound(nodes[ii].begin(), nodes[ii].end(), j) - nodes[ii].begin(); jj >= 1; jj -= jj & -jj) {
            res = max(res, bit[ii][jj]); 
        }
    }
    return res;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> x[i] >> y[i] >> z[i];
        items.push_back({x[i], y[i], z[i]});
        cx.push_back(x[i]);
        cy.push_back(y[i]);
    }

    cx.push_back(INF);
    sort(cx.begin(), cx.end());
    cx.resize(unique(cx.begin(), cx.end()) - cx.begin());

    cy.push_back(INF);
    sort(cy.begin(), cy.end());
    cy.resize(unique(cy.begin(), cy.end()) - cy.begin());
    
    sort(items.begin(), items.end());
    for (int i = 1; i <= n; i++) {
        x[i] = lower_bound(cx.begin(), cx.end(), items[i - 1][0]) - cx.begin() + 1;
        y[i] = lower_bound(cy.begin(), cy.end(), items[i - 1][1]) - cy.begin() + 1;
        z[i] = items[i - 1][2];
    }

    sz = cx.size();

    nodes.resize(sz + 5);
    bit.resize(sz + 5);

    for (int i = 1; i <= n; i++) {
        fakeupd(x[i], y[i]);
    }

    for (int i = 1; i <= sz; i++) {
        nodes[i].push_back(INF);
        sort(nodes[i].begin(), nodes[i].end());
        nodes[i].resize(unique(nodes[i].begin(), nodes[i].end()) - nodes[i].begin());
        bit[i].resize(nodes[i].size() + 1);
    }


    int ans = 0;
    for (int i = 1; i <= n; i++) {
        dp[i] = que(x[i], y[i]) + z[i];
        upd(x[i], y[i], dp[i]);
        ans = max(ans, dp[i]);
    }

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

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: ACCEPTED

Test 65

Verdict: ACCEPTED

Test 66

Verdict: ACCEPTED

Test 67

Verdict: ACCEPTED

Test 68

Verdict: ACCEPTED

Test 69

Verdict: ACCEPTED

Test 70

Verdict: ACCEPTED

Test 71

Verdict: ACCEPTED

Test 72

Verdict: ACCEPTED

Test 73

Verdict: ACCEPTED