摘要：
Counting OffspringTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionYou are given a tree, it’s root is p, and the node is numbered from 1 to n. Now define f(i) as the number of nodes whose number is less than i in all the succeeding nodes of node i. N 阅读全文
posted @ 2013-09-07 13:54
流水依依
阅读(237)
评论(0)
推荐(0)
浙公网安备 33010602011771号