xiaoxiede_wo的博客

题目链接:CSU OJ 1216#include<bits/stdc++.h>using namespace std;const int maxn = 100000 + 5; //集合中的数字个数typedef long long LL;int ch[32 * maxn][2]; //节点的边信息LL value[32 * ma...

题目链接:hdu1251用c++交a，用g++会memery 超限#include<cstdio>#include<cmath>#include<cstring>#include<iostream>#include<algorithm>using namespace std;struct node{ i...

字典树详解博客HDU1251#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#include<iostream>using namespace std;char s[15];typedef struct Trie_node{ ...

题目链接题意：给出n(3≤n≤1000)n(3≤n≤1000)个数字，求max(si+sj)⨁skmax(si+sj)⨁sk，而且i,j,ki,j,k互不相等。建一个字典树直接找，每次先删除a[i],a[j]然后找出剩下的与a[i]+a[j]的最大异或和，然后然把a[i],a[j]插回去#include <cstdio>#include <cstring&gt...