1, [] BZOJ2115 Xor (linear-yl)
To give a non-connected graph, the right side edge has, n-seeking $ $ XOR path and the maximum from $ 1 to $.
$ Yyb $ practices like mine, but I can not prove.
$ Dfs $ process, the units were considered simple ring (back side where the ancestral ring) contribution and the contribution of the road. Contribution linear throw ring group, and then the contribution of $ 1 ~ n $ linear path group in seeking the maximum throw on the line.
2, [] BZOJ4568 lucky number (linear group, ST table)
Immortal operations: group and linear. Violence, the complexity of the two $ log $
Then with $ LCA $ query with the $ ST $ table. (Note, do not run during the LCA $ $, since the overlap may be, it will plurality $ log $).
3, [] BZOJ3105 Nim new game (linear-yl)
I could not even $ Nim $ game will not, and gave me a new $ Nim $ game.
First $ yy $ about $ Nim $ game: There are some matches heap, each heap root has a number of matches (matches the number of different stacks may be different). Two players take turns operating, each can choose a stack took several matches a match. You can only take one, you can also take a whole heap of matches, but can not take over from the pile of matches. Take the last match of the player wins.
When the stack matches the exclusive OR $ 0 and $, FLAC win, on the contrary, the upper hand win.
That this question is obviously, is to let you choose and the number as small as possible, so that the rest of the arbitrary number of sub-sets of XOR and not $ 0 $, descending after sorting, followed by insertion of a linear group greedy election can be.