09 2014 档案

摘要:Find them, Catch themTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 31840Accepted: 9807DescriptionThe police office in Tadu City decides to ... 阅读全文
posted @ 2014-09-09 17:01 Fighting_frank 阅读(165) 评论(0) 推荐(0)
摘要:Nearest Common AncestorsTime Limit:1000MSMemory Limit:10000KTotal Submissions:18598Accepted:9860DescriptionA rooted tree is a well-known data structur... 阅读全文
posted @ 2014-09-04 18:03 Fighting_frank 阅读(169) 评论(0) 推荐(0)