AmazingCounters.com
摘要: 传送门:http://poj.org/problem?id=1330Nearest Common AncestorsTime Limit: 1000MSMemory Limit: 10000KDescriptionA rooted tree is a well-known data structur... 阅读全文
posted @ 2014-08-02 11:23 ZJDx1998 阅读(104) 评论(0) 推荐(0) 编辑
摘要: 传送门:http://poj.org/problem?id=1470Closest Common AncestorsTime Limit: 2000MSMemory Limit: 10000KDescriptionWrite a program that takes as input a roote... 阅读全文
posted @ 2014-08-02 10:58 ZJDx1998 阅读(146) 评论(0) 推荐(0) 编辑