解题报告
Bipedal_Bit
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
poj 1015 Jury Compromise 状态压缩DP(不压缩也行)
Jury Compromise Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 24261 Accepted: 6313 Special Judge Description In Frobnia, a far-away country, the verdicts in court trials are determi原创 2014-04-13 23:20:28 · 752 阅读 · 0 评论 -
poj 3628 Bookshelf 2 01背包
Bookshelf 2 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7167 Accepted: 3298 Description Farmer John recently bought another bookshelf for the cow lib原创 2014-04-27 22:37:45 · 781 阅读 · 0 评论 -
poj 1125 Stockbroker Grapevine——Floyd
Stockbroker Grapevine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 25234 Accepted: 13939 Description Stockbrokers are known to overreact to rumours. You have been contracted to dev原创 2014-04-12 16:33:02 · 893 阅读 · 0 评论 -
poj 3259 Wormholes SPFA
Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 28008 Accepted: 10080 Description While exploring his many farms, Farmer John has discovered a number of amazing wormholes.原创 2014-04-12 11:32:08 · 967 阅读 · 0 评论 -
poj 1062 昂贵的婚礼 Dijkstra
昂贵的聘礼 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 34683 Accepted: 9912 Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"原创 2014-04-11 14:05:14 · 813 阅读 · 0 评论 -
poj 1002 487-3279 map的使用
487-3279 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 232988 Accepted: 40620 Description Businesses like to have memorable telephone numbers. One way to make a telephone number mem原创 2014-04-08 23:23:40 · 1261 阅读 · 0 评论 -
poj1050 To the Max 暴力DP
To the Max Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 39290 Accepted: 20734 Description Given a two-dimensional array of positive and negative integers,原创 2014-04-23 09:26:05 · 666 阅读 · 0 评论 -
poj 1094 Sorting It All Out 拓扑排序
Sorting It All Out Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 26019 Accepted: 9009 Description An ascending sorted sequence of distinct values is one in which some form of a less原创 2014-04-02 18:42:23 · 840 阅读 · 0 评论 -
poj 2385 Apple Catching 简单DP
Apple Catching Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7108 Accepted: 3469 Description It is a little known fact that cows love apples. Farmer John h原创 2014-04-17 18:56:59 · 1164 阅读 · 0 评论 -
poj 1789 Truck History 最小生成树
Truck History Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16565 Accepted: 6364 Description Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for v原创 2014-04-02 15:02:50 · 779 阅读 · 0 评论 -
poj 1088 滑雪 深搜(谁说是DP了!)
滑雪 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 72671 Accepted: 26825 Description Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升原创 2014-04-17 15:08:46 · 911 阅读 · 0 评论 -
poj 1861 Network 最小生成树
Network Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 12839 Accepted: 4937 Special Judge Description Andrew is working as system administrator and is planning to establish a new net原创 2014-04-01 21:35:36 · 877 阅读 · 0 评论 -
poj 3041 Asteroids 二分图最小点覆盖
Asteroids Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13764 Accepted: 7485 Description Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an原创 2014-03-31 20:27:19 · 810 阅读 · 0 评论 -
poj 3020 Antenna Placement 二分图最小路径覆盖
Antenna Placement Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6126 Accepted: 3029 Description The Global Aerial Research Centre has been allotted the task of building the fifth ge原创 2014-03-31 20:03:03 · 1049 阅读 · 0 评论 -
poj 1469 COURSES 二分图最大匹配数
COURSES Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 16542 Accepted: 6489 Description Consider a group of N students and P courses. Each student visits zero, one or more than one c原创 2014-03-31 19:02:00 · 875 阅读 · 0 评论 -
poj 1251 Jungle Roads 最小生成树
Jungle Roads Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 18327 Accepted: 8322 Description The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign原创 2014-03-31 23:18:42 · 759 阅读 · 0 评论 -
poj 2239 Selecting Courses 二分图最大匹配数
Selecting Courses Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8174 Accepted: 3625 Description It is well known that it is not easy to select courses in the college, for there is u原创 2014-03-31 19:18:25 · 805 阅读 · 0 评论 -
poj 1127 Jack Straws 线段判交+并查集
Jack Straws Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3277 Accepted: 1473 Description In the game of Jack Straws, a number of plastic or wooden "straws原创 2015-03-29 11:14:12 · 1125 阅读 · 0 评论
分享