商人从(0,0)走到(1e9,1e9)途中有若干村庄,商人可以向(x,y+1)(x+1, y)(x+1, y+1)三个方向前进,当向(x+1,y+1)方向前进时可以获得村庄(x+1, y+1)的利润,问商人途中最多可以挣多少钱
商人到达点(x,y)的最大利润一定是从(0,0)到(x-1,y-1)这个矩形转移而来的,但是如果单纯的用二维来dp会超空间,可以考虑dp的顺序而降低dp维度,dp顺序从上到下,从右到左,这样dp[i] = max(dp[k]) + val[i][j] 1 < K < i这样就降低了一维,用树状数组来处理区间最大值
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int mx = 1e5+5;
typedef long long ll;
struct node {
int x, y;
ll val;
bool operator <(const node b) const {
if (y != b.y) return y < b.y;
return x > b.x;
}
}pt[mx];
ll c[mx], pos[mx], n;
int lowbit(int x) {
return x & -x;
}
void add(int x, ll val) {
for (int i = x; i <= n; i+=lowbit(i)) {
c[i] = max(c[i], val);
}
}
ll query(int x) {
ll ans = 0;
for (int i = x; i > 0; i-=lowbit(i)) {
ans = max(ans, c[i]);
}
return ans;
}
int main() {
int T;
scanf("%d", &T);
while (T--) {
memset(c, 0 , sizeof(c));
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d%lld", &pt[i].x, &pt[i].y, &pt[i].val);
pt[i].x++;
pos[i] = pt[i].x;
}
sort(pt+1, pt+1+n);
sort(pos+1, pos+1+n);
ll res = 0;
for (int i = 1; i <= n; i++) {
int k = lower_bound(pos+1, pos+1+n, pt[i].x)-pos;
ll val = pt[i].val + query(k-1);
//printf("k = %d query(k-1) = %d val = %d\n", k, query(k-1), val);
res = max(res, val);
add(k, val);
}
printf("%lld\n", res);
}
return 0;
}