ACMer'

【HDU 5758】Explorer Bo（树型dp）Explorer BoTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 489    Accepted Submission(s): 163Problem Description Exp

【POJ 3140】 Contestants Division（树型dp）Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9121 Accepted: 2623DescriptionIn the new ACM-ICPC Regional Contest, a

【POJ 2486】 Apple Tree（树型dp）Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8981 Accepted: 2990DescriptionWshxzt is a lovely girl. She likes apple very muc

【POJ 1947】Rebuilding Roads（树型DP）Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 10607 Accepted: 4863DescriptionThe cows have reconstructed Farmer John's

【Poj 2507】The Lost House（树型dp）Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 2457 Accepted: 1020DescriptionOne day a snail climbed up to a big tree and f

【HDU 5647】DZY Loves Connecting（树DP）DZY Loves ConnectingTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 332    Accepted Submission(s): 11

【HDOJ 5834】Magic boy Bi Luo with his excited tree（树型DP）Magic boy Bi Luo with his excited treeTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Problem Description Bi

C. Centroidstime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputTree is a connected acyclic graph. Suppose you are given a tree consisting of n vertice