YJJ's Salesman 【HDU - 6447】【树状数组】

题目链接

 

相似例题

---

  这道题恰巧做过相似的，要稍微简单一点，因为不用处理同一点的值之和了，就是它的X以及Y都要做到完全小于才可以取，不然就不能取。

---

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 1e5 + 7;
int N, X[maxN], Y[maxN], num, cnt_x, cnt_y, trie[maxN];
struct node
{
    int x, y, val;
    node(int a=0, int b=0, int c=0):x(a), y(b), val(c) {}
    friend bool operator == (node e1, node e2) { return e1.x == e2.x && e1.y == e2.y; }
}a[maxN];
bool cmp(node e1, node e2) { return e1.x == e2.x?(e1.y > e2.y):(e1.x < e2.x); }
void update(int i, int val)
{
    if(i == 0) return;
    while(i < maxN)
    {
        trie[i] = max(trie[i], val);
        i += lowbit(i);
    }
}
int query(int i)
{
    int ans = 0;
    while(i)
    {
        ans = max(ans, trie[i]);
        i -= lowbit(i);
    }
    return ans;
}
inline void init()
{
    num = 0;
    cnt_x = cnt_y = 1;
    memset(trie, 0, sizeof(trie));
}
int main()
{
    int T;  scanf("%d", &T);
    while(T--)
    {
        init();
        scanf("%d", &N);
        for(int i=1; i<=N; i++)
        {
            scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].val);
//            X[i] = a[i].x;
            Y[i] = a[i].y;
        }
//        sort(X + 1, X + N + 1);
        sort(Y + 1, Y + N + 1);
//        cnt_x = (int)(unique(X + 1, X + N + 1) - X - 1);
        cnt_y = (int)(unique(Y + 1, Y + N + 1) - Y - 1);
        sort(a + 1, a + 1 + N, cmp);
        for(int i=1; i<=N; i++)
        {
            int pos = (int)(lower_bound(Y + 1, Y + cnt_y + 1, a[i].y) - Y);
            int val = query(pos - 1);
            update(pos, val + a[i].val);
        }
        printf("%d\n", query(cnt_y));
    }
    return 0;
}