摘要：
hdu 2586:题意：输入n个点的n-1条边的树，m组询问任意点 a b之间的最短距离 思路：LCA中的Tarjan算法,RMQ还不会。。 hdu 2874：和上题一样都是求两点之间的最短距离，但是有多棵树，所以存在不连通的情况（用father判断一下就OK），，然后华丽丽的 超内存，拿别人的代码 阅读全文
摘要：
Nearest Common Ancestors Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 23795 Accepted: 12386 Description A rooted tree is a well-known da 阅读全文
摘要：
Pseudoforest Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2351 Accepted Submission(s): 910 Pr 阅读全文
摘要：
D-City Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2933 Accepted Submission(s): 1038 Problem 阅读全文
摘要：
A Bug's Life Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12944 Accepted Submission(s): 4215 阅读全文
摘要：
食物链 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 58979 Accepted: 17247 Description 动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动 阅读全文
摘要：
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3038 题意：给出区间[1,n],下面有m组数据，l r v区间[l,r]之和为v,每输入一组数据，判断此组条件是否与前面冲突 ,最后输出与前面冲突的数据的个数.比如 [1 5]区间和为100 然后后面给 阅读全文
摘要：
Connect the Cities Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15569 Accepted Submission(s): 阅读全文
摘要：
K-th Number Time Limit: 20000MS Memory Limit: 65536K Total Submissions: 45653 Accepted: 15177 Case Time Limit: 2000MS Description You are working for 阅读全文
摘要：
Corporative Network Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 3664 Accepted: 1326 Description A very big corporation is developing it 阅读全文