随笔分类 - 数据结构--划分树
摘要:PT07J - Query on a tree III #tree #tree You are given a node-labeled rooted tree with n nodes. Define the query (x, k): Find the node whose label is k
阅读全文
摘要:Super Mario Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6077 Accepted Submission(s): 2645 Pro
阅读全文
摘要:Minimum Sum Time Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4156 Accepted Submission(s): 941 Pro
阅读全文
摘要:The Famous ICPC Team Again Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1440 Accepted Submis
阅读全文
摘要:K-th Number Time Limit: 20000MS Memory Limit: 65536K Total Submissions: 52651 Accepted: 18091 Case Time Limit: 2000MS Description You are working for
阅读全文