随笔分类 - Aizu OJ
http://judge.u-aizu.ac.jp/onlinejudge/
摘要:Aizu 2170: http://www.cnblogs.com/lzj-0218/p/3273342.html
阅读全文
摘要:Marked AncestorTime Limit : 8 sec, Memory Limit : 65536 KBProblem F:Marked AncestorYou are given a treeTthat consists ofNnodes. Each node is numbered from 1 toN, and node 1 is always the root node ofT. Consider the following two operations onT:M v: (Mark) Mark nodev.Q v: (Query) Print the index of t
阅读全文

浙公网安备 33010602011771号