2013年7月26日
hdu 4612 Warm up(双连通缩点+树直径，4级)
摘要： Warm upTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 955Accepted Submission(s): 193 Problem Description N planets are connected by M bidirectional channels that allow instant transportation. It's always possible to travel between any two pl 阅读全文
posted @ 2013-07-26 18:51 剑不飞 阅读(211) 评论(0) 推荐(0) 编辑
hdu 4616 Game (树形DP，4级)
摘要： GameTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 336Accepted Submission(s): 92 Problem Description Nowadays, there are more and more challenge game on TV such as 'Girls, Rush Ahead'. Now, you participate int a game like this. There are 阅读全文
posted @ 2013-07-26 15:27 剑不飞 阅读(424) 评论(0) 推荐(0) 编辑
hdu 4618 Palindrome Sub-Array(暴力啊，3级)
摘要： Palindrome Sub-ArrayTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 249Accepted Submission(s): 129 Problem Description A palindrome sequence is a sequence which is as same as its reversed order. For example, 1 2 3 2 1 is a palindrome sequence, bu. 阅读全文
posted @ 2013-07-26 13:21 剑不飞 阅读(290) 评论(0) 推荐(0) 编辑
hdu 4619 Warm up 2(最大独立点集，二分匹配，4级)
摘要： Warm up 2Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 449Accepted Submission(s): 225 Problem Description Some 1×2 dominoes are placed on a plane. Each dominoe is placed either horizontally or vertically. It's guaranteed the dominoes in 阅读全文
posted @ 2013-07-26 12:47 剑不飞 阅读(221) 评论(0) 推荐(0) 编辑