HDU5536(字典树)

题意是从n个数中选出不同的三个数a,b,c使得（a+b）^c最大。

拆位，为了保险起见我搞了35位，然后每一位按照0或者1往下走。因为不能选一样的数字所以需要修改字典树。

动态的比较耗时。

#include <bits/stdc++.h>
using namespace std;
#define maxn 1111
#define INF 1e16

struct node {
    node *next[2];
    long long cnt;
}*root;
long long a[maxn];
int n;
long long cur;
long long Max;

void build_trie (long long num) {
    node *p = root, *q;
    for (long long i = Max; i >= 1; i >>= 1) {
        int id = ((i&num)>0);
        if (p->next[id] == NULL) {
            q = new node;
            q->next[0] = q->next[1] = NULL;
            p->next[id] = q;
            p = p->next[id];
            p->cnt = 1;
        }
        else {
            p = p->next[id];
            p->cnt++;
        }
        if (i == 0)
            break;
    }
}

void vis (long long num) { //设立访问标记
    node *p = root;
    for (long long i = Max; i >= 1; i >>= 1) {
        int id = ((i&num)>0);
        p = p->next[id];
        p->cnt--;
        if (i == 0)
            break;
    }
}

void anti_vis (long long num) { //除去访问标记
    node *p = root;
    for (long long i = Max; i >= 1; i >>= 1) {
        int id = ((i&num)>0);
        p = p->next[id];
        p->cnt++;
        if (i == 0)
            break;
    }
}

void del_trie (node *p) {
    if (p == NULL)
        return ;
    if (p->next[0] != NULL)
        del_trie (p->next[0]);
    if (p->next[1] != NULL)
        del_trie (p->next[1]);
    free (p);
    p = NULL;

    return ;
}

void solve (long long num) {
    node *p = root;
    for (long long i = Max; i >= 1; i >>= 1) {
        int id = ((i&num)>0);
        cur <<= 1;
        if (p->next[id^1] != NULL && p->next[id^1]->cnt) {
            cur += (id^1);
            p = p->next[id^1];
        }
        else {
            cur += id;
            p = p->next[id];
        }
        if (i == 0)
            break;
    }
    return ;
}

int main () {
    //freopen ("in", "r", stdin);
    Max = 1;
    Max <<= 35;
    int t;
    scanf ("%d", &t);
    while (t--) {
        scanf ("%d", &n);
        root = new node;
        root->next[0] = root->next[1] = NULL;
        for (int i = 1; i <= n; i++) {
            scanf ("%lld", &a[i]);
            build_trie (a[i]);
        }
        long long ans = 0;
        for (int i = 1; i <= n; i++) {
            for (int j = i+1; j <= n; j++) {
                vis (a[i]); vis (a[j]);
                cur = 0;
                solve (a[i]+a[j]);
                ans = max (cur^(a[i]+a[j]), ans);
                anti_vis (a[i]); anti_vis (a[j]);
            }
        }
        del_trie (root);
        printf ("%lld\n", ans);
    }
    return 0;
}