NOIP2012
select
PJ -4.5
6. preorder tree traversal sequence, to draw
17. The study defined a wide area network such as Bluetooth, etc. to a local area network
19. moderation, the different sub-sequence number
TG -7.5
11. Obviously \ ({2 ^ (n-+. 1)} = n-2 * 2 ^ \) , are intended other undesirable problems.
15. The binary nature of the investigation, the maximum number of leaf nodes should be \ (n-/ 2 +. 1 \) ? Therefore, 9, 10 leaf nodes are feasible
16. Investigation shortest, \ (C \) option if \ (D (V1, V3)> D (V1, V2) + D (V2, V3) \) , then \ (d (v1, v3) \) to not the most shorted out
18. The infinite decimals into binary is still infinite decimals
20. A \ (P \) and \ (the NP \) problem, in fact, the definition is written complexity , both in time and space complexity.
NOIP2015
TG
15. The study Huffman tree, it is recommended to eat NOI2015 Homer . (Write solution to a problem that may goo1 year