POJ 3764 The xor-longest Path(xor trie)

题意: $N\le 10^5个点的树,A_i < 2^{31}$$路径异或和:=路径上所有边权的异或和,求最大的路径异或和$     Read more
TaoSama's avatar
TaoSama May 01, 2016

HDU 5536 Chip Factory(xor trie)

题意: $3\le N\le 10^3个数,求\max_{i,j,k} (s_i+s_j) \oplus s_k的最大值,i\ne j\ne k$     Read more
TaoSama's avatar
TaoSama May 01, 2016

HDU 4825 Xor Sum(xor trie)

题意: $N\le 10^5个数,M\le 10^5次询问$$每次询问给出一个整数K,从数列A_i中找出一个数S使得K\oplus S值最大$     Read more
TaoSama's avatar
TaoSama May 01, 2016

CSU 1720 How to Get 2^n(trie上贪心、高精度)

题意: $给定N\le 10^5个数,1\le A_i\le 10^{30}(2^{100}>10^{30})$$求A_i+A_j=2^x的(i, j)对数$     Read more
TaoSama's avatar
TaoSama Apr 29, 2016

HDU 5289 Assignment(two pointers)

题意: $N\le 10^5的序列,A_i\le 10^9$$求连续区间中任意2个数差值不超过k的区间个数$     Read more
TaoSama's avatar
TaoSama Apr 12, 2016

Educational Codeforces Round 11 C. Hard Process(two pointers)

题意: $N\le 3\times 10^5的序列,A_i = 0 或者1$$k\le N次操作将0变成1,求最长的连续1序列长度,并打印方案$     Read more
TaoSama's avatar
TaoSama Apr 10, 2016

VK Cup 2016 - Round 1 D. Bear and Polynomials(哈希)

题意: $N\le 2\times 10^5,给定一个N次多项式,即P(x)=\sum_{i=0}^N a_i\cdot x^i$$已经P(2)\neq 0,现要改变其中一个系数a_i,使得P’(2)=0$$求方法数$     Read more
TaoSama's avatar
TaoSama Mar 29, 2016