From 627453e09fded311b3059864f69f3745756ef412 Mon Sep 17 00:00:00 2001
From: SeoHyeon <tjgus1668@naver.com>
Date: Sat, 3 Aug 2024 13:09:54 +0900
Subject: [PATCH] =?UTF-8?q?Create=2010167=5F=EA=B8=88=EA=B4=91.cpp?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../10167_\352\270\210\352\264\221.cpp"       | 99 +++++++++++++++++++
 1 file changed, 99 insertions(+)
 create mode 100644 "\354\241\260\354\204\234\355\230\204/10167_\352\270\210\352\264\221.cpp"

diff --git "a/\354\241\260\354\204\234\355\230\204/10167_\352\270\210\352\264\221.cpp" "b/\354\241\260\354\204\234\355\230\204/10167_\352\270\210\352\264\221.cpp"
new file mode 100644
index 0000000..af5e3eb
--- /dev/null
+++ "b/\354\241\260\354\204\234\355\230\204/10167_\352\270\210\352\264\221.cpp"
@@ -0,0 +1,99 @@
+#include <bits/stdc++.h>
+#define first x
+#define second y
+
+using namespace std;
+typedef long long int ll;
+
+constexpr int MAX = 3001, SEGSZ = 1 << 13;
+// constexpr int MAX = 15, SEGSZ = 1 << 4;
+
+struct gold
+{
+    int x, y;
+    int w;
+} g[MAX];
+
+int xTmp[MAX], yTmp[MAX], loc[MAX];
+vector<pair<int, int>> delta[MAX];
+
+struct node
+{
+    ll lmx, rmx, mx, sum;
+    node(ll v) {
+        lmx = rmx = mx = sum = v;
+    }
+    node () : node(0) {}
+    node operator+(const node& o) const{
+        node ret = node();
+        ret.lmx = max(lmx, sum + o.lmx);
+        ret.rmx = max(o.rmx, o.sum + rmx);
+        ret.mx = max({mx, o.mx, rmx + o.lmx});
+        ret.sum = sum + o.sum;
+        return ret;
+    }
+} seg[SEGSZ];
+
+node& init(int s, int e, int i = 1){
+    if (s == e){
+        loc[s] = i;
+        return seg[i] = node(0);
+    }
+    int m = (s + e) >> 1;
+    return seg[i] = init(s, m, i << 1) + init(m + 1, e, i << 1 | 1);
+}
+
+void add(int idx, int v){
+    int i = loc[idx];
+    assert(seg[i].lmx == seg[i].rmx && seg[i].lmx == seg[i].mx);
+    seg[i] = node(seg[i].lmx + v);
+    while (i >>= 1) seg[i] = seg[i << 1] + seg[i << 1 | 1];
+}
+
+int main(){
+    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
+
+    int n; cin >> n;
+    for (int i = 0; i < n; ++i) cin >> g[i].x >> g[i].y >> g[i].w, xTmp[i] = g[i].x, yTmp[i] = g[i].y;
+
+    // 좌표 압축
+    sort(xTmp, xTmp + n); sort(yTmp, yTmp + n);
+    unordered_map<int, int> xComp(n), yComp(n);
+    int x = 0, y = 0;
+    for (int i = 0; i < n; ++i){
+        if (xComp.find(xTmp[i]) == xComp.end()) xComp[xTmp[i]] = x++;
+        if (yComp.find(yTmp[i]) == yComp.end()) yComp[yTmp[i]] = y++;
+    }
+    for (int i = 0; i < n; ++i) g[i].x = xComp[g[i].x], g[i].y = yComp[g[i].y];
+
+    for (int i = 0; i < n; ++i){
+        auto& [x, y, w] = g[i];
+        delta[x].push_back({y, w});
+    }
+    
+    assert(x <= n && y <= n);
+    init(0, n - 1);
+    ll ans = 0;
+    for (int i = 0; i < n; ++i){
+        for (auto& [y, w] : delta[i]){
+            add(y, w);
+        }
+        auto& nd = seg[1];
+        ans = max(ans, max({nd.lmx, nd.rmx, nd.mx}));
+        for (int j = 0; j < i; ++j){
+            for (auto& [y, w] : delta[j]){
+                add(y, -w);
+            }
+            auto& nd = seg[1];
+            ans = max(ans, max({nd.lmx, nd.rmx, nd.mx}));
+        }
+        for (int j = 0; j < i; ++j){
+            for (auto& [y, w] : delta[j]){
+                add(y, w);
+            }
+        }
+    }
+
+    assert(ans >= 0);
+    cout << ans << '\n';
+}
\ No newline at end of file