码代码的猿猿

2013年9月6日

摘要： Antenna PlacementTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5645Accepted: 2825DescriptionThe Global Aerial Research Centre has been allotted the task of building the fifth generation of ... 阅读全文

posted @ 2013-09-06 23:15 码代码的猿猿阅读(159) 评论(0) 推荐(0)

Milking Cows

摘要： Milking CowsThree farmers rise at 5 am each morning and head for the barn to milk three cows. The first farmer begins milking his cow at time 300 (measured in seconds after 5 am) and ends at time 1000... 阅读全文

posted @ 2013-09-06 07:34 码代码的猿猿阅读(299) 评论(0) 推荐(0)

POJ 3041 Asteroids

摘要：最小点覆盖数==最大匹配数AsteroidsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 12678Accepted: 6904DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of ... 阅读全文

posted @ 2013-09-06 00:03 码代码的猿猿阅读(128) 评论(0) 推荐(0)

二分图最大匹配的König定理及其证明

摘要：二分图最大匹配的K?nig定理及其证明本文将是这一系列里最短的一篇，因为我只打算把K?nig定理证了，其它的废话一概没有。以下五个问题我可能会在以后的文章里说，如果你现在很想知道的话，网上去找找答案： 1. 什么是二分图； 2. 什么是二分图的匹配； 3. 什么是匈牙利算法；(http://www.matrix67.com/blog/article.asp?id... 阅读全文

posted @ 2013-09-06 00:01 码代码的猿猿阅读(299) 评论(0) 推荐(0)

2013年9月5日

HDOJ 2389 Rain on your Parade

摘要： HK。。。。Rain on your ParadeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 655350/165535 K (Java/Others)Total Submission(s): 2229 Accepted Submission(s): 696Problem DescriptionYou’re giving ... 阅读全文

posted @ 2013-09-05 23:00 码代码的猿猿阅读(161) 评论(0) 推荐(0)

HDOJ 1083 Courses

摘要： Hopcroft-Karp算法模板CoursesTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2930 Accepted Submission(s): 1376Problem DescriptionConsider a grou... 阅读全文

posted @ 2013-09-05 21:12 码代码的猿猿阅读(109) 评论(0) 推荐(0)

HDOJ 2063 过山车

摘要：过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7856 Accepted Submission(s): 3434Problem DescriptionRPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。... 阅读全文

posted @ 2013-09-05 04:31 码代码的猿猿阅读(206) 评论(0) 推荐(0)

POJ 1469 COURSES

摘要：原来匈牙利是这么写的。。。。。Hungary ['h??ɡ?ri] n. 匈牙利（欧洲国家名） COURSESTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 15659Accepted: 6186DescriptionConsider a group of N students and P courses. Each student... 阅读全文

posted @ 2013-09-05 00:42 码代码的猿猿阅读(132) 评论(0) 推荐(0)

2013年9月4日

UESTC 1817 Complete Building the Houses

摘要： Complete Building the HousesTime Limit: 2000MSMemory Limit: 65535KB64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionBear has a large, empty ground for him to build a home. He d... 阅读全文

posted @ 2013-09-04 22:11 码代码的猿猿阅读(316) 评论(0) 推荐(0)

POJ 3464 ACM Computer Factory

摘要： ACM Computer FactoryTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4829Accepted: 1641Special JudgeDescriptionAs you know, all the computers used for ACM contests must be identical, so the pa... 阅读全文

posted @ 2013-09-04 16:47 码代码的猿猿阅读(255) 评论(0) 推荐(0)

码代码的猿猿

公告