h_z_cong - 博客园

POJ3159 Candies —— 差分约束 spfa

摘要：题目链接：http://poj.org/problem?id=3159 Candies Time Limit: 1500MS Memory Limit: 131072K Total Submissions: 33576 Accepted: 9422 Description During the ki 阅读全文

posted @ 2017-09-30 09:39 h_z_cong 阅读(216) 评论(0) 推荐(0) 编辑

POJ1511 Invitation Cards —— 最短路spfa

摘要：题目链接：http://poj.org/problem?id=1511 Invitation Cards Time Limit: 8000MS Memory Limit: 262144K Total Submissions: 29286 Accepted: 9788 Description In t 阅读全文

posted @ 2017-09-29 12:32 h_z_cong 阅读(315) 评论(0) 推荐(0) 编辑

POJ1860 Currency Exchange —— spfa求正环

摘要：题目链接：http://poj.org/problem?id=1860 Currency Exchange Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 32128 Accepted: 12228 Description Sev 阅读全文

posted @ 2017-09-28 19:43 h_z_cong 阅读(333) 评论(0) 推荐(0) 编辑

POJ3259 Wormholes —— spfa求负环

摘要：题目链接：http://poj.org/problem?id=3259 Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 55082 Accepted: 20543 Description While explo 阅读全文

posted @ 2017-09-27 22:07 h_z_cong 阅读(268) 评论(0) 推荐(0) 编辑

POJ3660 Cow Contest —— Floyd 传递闭包

摘要：题目链接：http://poj.org/problem?id=3660 Cow Contest Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13085 Accepted: 7289 Description N (1 ≤ N ≤ 阅读全文

posted @ 2017-09-27 22:02 h_z_cong 阅读(203) 评论(0) 推荐(0) 编辑

POJ3268 Silver Cow Party —— 最短路

摘要：题目链接：http://poj.org/problem?id=3268 Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 24527 Accepted: 11164 Description One 阅读全文

posted @ 2017-09-26 16:38 h_z_cong 阅读(208) 评论(0) 推荐(0) 编辑

POJ1797 Heavy Transportation —— 最短路变形

摘要：题目链接：http://poj.org/problem?id=1797 Heavy Transportation Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 39999 Accepted: 10515 Description 阅读全文

posted @ 2017-09-26 11:04 h_z_cong 阅读(356) 评论(0) 推荐(0) 编辑

POJ2253 Frogger —— 最短路变形

摘要：题目链接：http://poj.org/problem?id=2253 Frogger Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 49409 Accepted: 15729 Description Freddy Frog i 阅读全文

posted @ 2017-09-26 10:59 h_z_cong 阅读(337) 评论(0) 推荐(0) 编辑

POJ1759 Garland —— 二分

摘要：题目链接：http://poj.org/problem?id=1759 Garland Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 2477 Accepted: 1054 Description The New Year ga 阅读全文

posted @ 2017-09-24 11:37 h_z_cong 阅读(273) 评论(0) 推荐(0) 编辑

POJ3685 Matrix —— 二分

摘要：题目链接：http://poj.org/problem?id=3685 Matrix Time Limit: 6000MS Memory Limit: 65536K Total Submissions: 7378 Accepted: 2187 Description Given a N × N ma 阅读全文

posted @ 2017-09-23 21:09 h_z_cong 阅读(221) 评论(0) 推荐(0) 编辑

POJ3621 Sightseeing Cows 最优比率环二分法

摘要：题目链接：http://poj.org/problem?id=3621 Sightseeing Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10552 Accepted: 3613 Description Farme 阅读全文

posted @ 2017-09-23 14:50 h_z_cong 阅读(257) 评论(0) 推荐(0) 编辑

POJ2728 Desert King —— 最优比率生成树二分法

摘要：题目链接：http://poj.org/problem?id=2728 Desert King Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 26878 Accepted: 7459 Description David the 阅读全文

posted @ 2017-09-21 21:38 h_z_cong 阅读(215) 评论(0) 推荐(0) 编辑

POJ3579 Median —— 二分

摘要：题目链接：http://poj.org/problem?id=3579 Median Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8286 Accepted: 2892 Description Given N numbers, 阅读全文

posted @ 2017-09-21 21:35 h_z_cong 阅读(286) 评论(0) 推荐(0) 编辑

POJ3111 K Best —— 01分数规划二分法

摘要：题目链接：http://poj.org/problem?id=3111 K Best Time Limit: 8000MS Memory Limit: 65536K Total Submissions: 11380 Accepted: 2935 Case Time Limit: 2000MS Spe 阅读全文

posted @ 2017-09-21 21:33 h_z_cong 阅读(319) 评论(0) 推荐(0) 编辑

POJ2976 Dropping tests —— 01分数规划二分法

摘要：题目链接：http://poj.org/problem?id=2976 Dropping tests Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13615 Accepted: 4780 Description In a ce 阅读全文

posted @ 2017-09-20 19:27 h_z_cong 阅读(299) 评论(0) 推荐(0) 编辑