1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
| #include <bits/stdc++.h>
#define _debug(x) cerr<< #x << " = "<<x <<endl
using namespace std;
typedef long long ll;
const ll INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int MAXN = 4000 + 59;
const int TreeSize = MAXN << 2;
struct SegTree {
#define lson (oo<<1)
#define rson (oo<<1|1)
int n;
ll sum[TreeSize];
ll lft[TreeSize];
ll rht[TreeSize];
ll ans[TreeSize];
void init(int _n) {
this->n = _n;
build(1, 1, _n);
}
void build(int oo, int l, int r) {
if (l == r) {
sum[oo] = lft[oo] = rht[oo] = ans[oo] = 0;
return;
}
int m = (l + r) >> 1;
build(lson, l, m);
build(rson, m + 1, r);
sum[oo] = lft[oo] = rht[oo] = ans[oo] = 0;
}
void update(int oo, int l, int r, int pos, ll val) {
if (l == r && r == pos) {
sum[oo] += val;
rht[oo] = max(0ll, sum[oo]);
lft[oo] = max(0ll, sum[oo]);
ans[oo] = max(0ll, sum[oo]);
return;
}
int m = (l + r) >> 1;
if (pos <= m)
update(lson, l, m, pos, val);
else
update(rson, m + 1, r, pos, val);
lft[oo] = lft[lson];
rht[oo] = rht[rson];
sum[oo] = sum[lson] + sum[rson];
ans[oo] = max(ans[lson], ans[rson]);
ans[oo] = max(ans[oo], rht[lson] + lft[rson]);
lft[oo] = max(lft[oo], sum[lson] + lft[rson]);
rht[oo] = max(rht[oo], rht[lson] + sum[rson]);
if (lft[lson] == sum[lson])
ans[oo] = max(ans[oo], lft[lson] + lft[rson]);
if (rht[rson] == sum[rson])
ans[oo] = max(ans[oo], rht[lson] + rht[rson]);
}
void update(int pos, ll val) {
update(1, 1, n, pos, val);
}
ll query() {
return ans[1];
}
};
SegTree tree;
struct point {
int x, y, v;
} p[MAXN];
int dsc[MAXN], dtot;
void initDsc() {
sort(dsc, dsc + dtot);
dtot = unique(dsc, dsc + dtot) - dsc;
}
int getDsc(const int &val) {
return lower_bound(dsc, dsc + dtot, val) - dsc + 1;
}
int n;
ll ans;
int Kase;
int xmax, ymax;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> Kase;
while (Kase--) {
ans = 0;
dtot = 0;
xmax = ymax = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> p[i].x >> p[i].y >> p[i].v;
dsc[dtot++] = p[i].x;
dsc[dtot++] = p[i].y;
}
initDsc();
for (int i = 1; i <= n; ++i) {
p[i].x = getDsc(p[i].x);
p[i].y = getDsc(p[i].y);
xmax = max(xmax, p[i].x);
ymax = max(ymax, p[i].y);
}
sort(p + 1, p + 1 + n, [](const point &a, const point &b) {
if (a.x == b.x)return a.y < b.y;
return a.x < b.x;
});
for (int l = 1; l <= n; l++) {
tree.init(ymax);
for (int r = l; r <= n; r++) {
tree.update(p[r].y, p[r].v);
if (p[r].x != p[r + 1].x) {
ans = max(ans, tree.query());
}
}
while (p[l].x == p[l + 1].x)l++;
}
cout << ans << '\n';
}
return 0;
}
|
