2014年02月_utobe67

原创 zoj 3506 Cut the Tree （好多细节的树形dp 终于把你搞懂了）

Cut the TreeTime Limit: 2 Seconds Memory Limit: 65536 KB Given a graph with N vertices (labeled 1 to N). The graph is connected, undirected and acyclic, and also known as an "unrooted

2014-02-28 16:56:43 1373

原创 10817 - Headmaster's Headache （状压dp）

题目链接：uva 10817题意：某个学校师资力量不够，要招收新的老师，第一行给出s、m、n，现在在任的老师有m个，然后给出m行表示每个老师的信息，分别是该老师的工资，以及可教授的课程（个数不一定），然后在n行表示可招收的老师信息，同样是工资和课程，s表示该学校开售的课程，问，最少花多少钱可以使得该学校开设的s个课程每个课程至少有两个老师任教。ps：现任的老师全部交，一个老师不

2014-02-28 12:02:04 1109

原创 Codeforces Round #232 (Div. 2) C. On Number of Decompositions into Multipliers 之我为何如此菜

C. On Number of Decompositions into Multiplierstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are give

2014-02-28 10:48:34 1355 1

原创 poj 3463 Sightseeing （次短路）

SightseeingTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6667 Accepted: 2372DescriptionTour operator Your Personal Holiday organises guided bus trips

2014-02-25 16:10:55 1052

原创 hdu 4323 Magic Number （最短编辑距离）

Magic NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1404 Accepted Submission(s): 589Problem DescriptionThere are many

2014-02-24 20:47:09 1056

原创 hdu 1561 The more, The Better (树形dp)

The more, The BetterTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4684 Accepted Submission(s): 2766Problem DescriptionACb

2014-02-19 10:48:51 856

原创 Codeforces Round #230 (Div. 1) B. Tower of Hanoi

B. Tower of Hanoitime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Tower of Hanoi is a well-known mathema

2014-02-19 10:10:11 1253

原创 poj 1947 Rebuilding Roads (树形dp)

Rebuilding RoadsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 8561 Accepted: 3831DescriptionThe cows have reconstructed Farmer John's farm, with its N

2014-02-17 21:04:10 905

原创 poj 2486 Apple Tree (树形dp)

Apple TreeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6674 Accepted: 2208DescriptionWshxzt is a lovely girl. She likes apple very much. One day HX t

2014-02-17 17:51:59 1278

原创 poj 2127 Greatest Common Increasing Subsequence （最长公共递增子序列）

Greatest Common Increasing SubsequenceTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 8888 Accepted: 2345Case Time Limit: 2000MS Special JudgeDes

2014-02-11 14:42:58 1271

原创 zoj 1013 Great Equipment

Great EquipmentTime Limit: 10 Seconds Memory Limit: 32768 KB Once upon a time, there lived Catherine Ironfist, the Queen of Enroth. One day, she received the news of her father's deat

2014-02-02 22:14:34 1421

原创 zoj 3264 Present for MM （坑题，写博客只是不想更多人被坑）

Present for MMTime Limit: 10 Seconds Memory Limit: 32768 KB One day, DD finds a strange hole with many treasures in it. He realizes that all the treasures are in pairs. Through deeply

2014-02-01 19:40:59 1502

To be what you what to be!