acm图论
关注
分享
扫一扫
文章平均质量分 90
jackgege
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ 2449 Remmarguts' Date （第K短路）
Remmarguts' Date Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 17634 Accepted: 4826 Description "Good man never makes girls wait or breaks an appointment!" sai...原创 2013-07-07 20:00:29 · 142 阅读 · 0 评论 -
POJ 2723 Get Luffy Out （二分 + 2-SAT判定）
Get Luffy Out Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 6609 Accepted: 2531 Description Ratish is a young man who always dreams of being a hero. One day his...原创 2013-07-09 11:33:28 · 169 阅读 · 0 评论 -
POJ 2942 Knights of the Round Table （点双联通分量+奇环判定）
Knights of the Round Table Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 7840 Accepted: 2450 Description Being a knight is a very attractive career: searching f...原创 2013-07-09 10:33:49 · 148 阅读 · 0 评论 -
POJ 3522 Slim Span （Kruskal最小生成树）
Slim Span Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 5412 Accepted: 2842 Description Given an undirected weighted graph G, you should find one of sp...原创 2013-07-09 10:20:19 · 165 阅读 · 0 评论 -
POJ 3164 Command Network （刘朱算法|最小树形图）
Command Network Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 10253 Accepted: 2976 Description After a long lasting war on words, a war on arms finally break...原创 2013-07-08 11:08:14 · 224 阅读 · 0 评论 -
POJ 2728 Desert King （最优比例生成树）
Desert King Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 18116 Accepted: 5087 Description David the Great has just become the king of a desert country. To win ...原创 2013-07-08 11:05:13 · 153 阅读 · 0 评论 -
POJ 1679 The Unique MST （Kruskal判断最小生成树是否唯一）
The Unique MST Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17062 Accepted: 5920 Description Given a connected undirected graph, tell if its minimum spanning t...原创 2013-07-08 09:46:00 · 379 阅读 · 0 评论 -
POJ 1639 Picnic Planning （最小k度生成树）
Picnic Planning Time Limit: 5000MS Memory Limit: 10000K Total Submissions: 8395 Accepted: 2971 Description The Contortion Brothers are a famous set of circus clowns, k...原创 2013-07-08 09:32:42 · 203 阅读 · 0 评论 -
POJ 3635 Full Tank? （最短路变形 + BFS）
Full Tank? Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5673 Accepted: 1853 Description After going through the receipts from your car trip through E...原创 2013-07-08 08:31:26 · 220 阅读 · 0 评论 -
POJ 3621 Sightseeing Cows （(二分+spfa求回路 | 最优比率环）
Sightseeing Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6758 Accepted: 2234 Description Farmer John has decided to reward his cows for their hard work...原创 2013-07-07 22:53:14 · 172 阅读 · 0 评论 -
POJ 3613 Cow Relays （FLoyd + 矩阵快速幂）
Cow Relays Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4471 Accepted: 1778 Description For their physical fitness program, N (2 ≤ N ≤ 1,000,000) cows have d...原创 2013-07-07 21:56:47 · 166 阅读 · 0 评论 -
POJ 3463 Sightseeing （最短路与次短路）
Sightseeing Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 6312 Accepted: 2228 Description Tour operator Your Personal Holiday organises guided bus trips...原创 2013-07-07 21:33:13 · 227 阅读 · 0 评论 -
POJ 3013 Big Christmas Tree （SPFA最短路）
Big Christmas Tree Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 18507 Accepted: 3947 Description Christmas is coming to KCM city. Suby the loyal civilian in...原创 2013-07-07 21:00:08 · 242 阅读 · 0 评论 -
POJ 1966 Cable TV Network （EK 最小割）
Cable TV Network Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 3442 Accepted: 1602 Description The interconnection of the relays in a cable TV network is ...原创 2013-07-10 12:24:46 · 200 阅读 · 0 评论