图
关注
分享
扫一扫
文章平均质量分 82
IT旅行
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
HDOJ 2680 Choose the best route（最短路，dijkstra）
Choose the best routeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6681 Accepted Submission(s): 2215Problem DescriptionOne原创 2014-08-01 20:27:14 · 371 阅读 · 0 评论 -
poj3114Countries in War（强连通分量加缩点）
Countries in WarTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2383 Accepted: 748DescriptionIn the year 2050, after different attempts of the UN to m原创 2014-08-12 11:01:43 · 375 阅读 · 0 评论 -
hdoj1532Drainage Ditches（网络流）
Drainage DitchesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9176 Accepted Submission(s): 4303Problem DescriptionEvery tim原创 2014-08-11 20:28:00 · 414 阅读 · 0 评论 -
hdoj2767 Proving Equivalences（强连通分量+缩点）
Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3093 Accepted Submission(s): 1162Problem DescriptionConsi原创 2014-08-11 22:28:14 · 667 阅读 · 0 评论 -
HDOJ1269 迷宫城堡（裸的强连通分量）
迷宫城堡Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7095 Accepted Submission(s): 3158Problem Description为了训练小希的方向感，Gardon建立了一原创 2014-08-08 09:56:42 · 311 阅读 · 0 评论 -
poj2387Til the Cows Come Home(dijkstra)
Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 29627 Accepted: 9964DescriptionBessie is out in the field and wants to get back to原创 2014-08-10 20:41:55 · 322 阅读 · 0 评论 -
hdoj3549 Flow Problem（裸的网络流）
Flow ProblemTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 7647 Accepted Submission(s): 3560Problem DescriptionNetwork flow原创 2014-08-10 11:25:08 · 389 阅读 · 0 评论 -
ZOJ 3195 Design the city
ZOJ Problem Set - 3195Design the cityTime Limit: 1 Second Memory Limit: 32768 KBCerror is the mayor of city HangZhou. As you may know, the traffic system of this city is so terrible,原创 2014-07-31 19:22:13 · 371 阅读 · 0 评论 -
HDOJ 2063过山车（匈牙利算法求最大匹配数）
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10418 Accepted Submission(s): 4591Problem DescriptionRPG girls今天和大家一起去游乐场玩原创 2014-07-29 18:54:23 · 438 阅读 · 0 评论 -
hdoj 1068 Girls and Boys（匈牙利算法，答案为顶点数减去最大匹配数）
Girls and BoysTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7167 Accepted Submission(s): 3254Problem Descriptionthe secon原创 2014-07-29 17:45:40 · 456 阅读 · 0 评论 -
poj 3522 Slim Span
Slim SpanTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6381 Accepted: 3382DescriptionGiven an undirected weighted graph G, you should find one of span原创 2014-07-28 22:25:48 · 282 阅读 · 0 评论 -
poj 1655 Balancing Act
Balancing ActTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8677 Accepted: 3580DescriptionConsider a tree T with N (1 <= N <= 20,000) nodes numbered 1.原创 2014-07-28 17:34:02 · 431 阅读 · 0 评论 -
poj2186 Popular Cows（tarjan + 缩点）
Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 23312 Accepted: 9541DescriptionEvery cow's dream is to become the most popular cow in the he原创 2014-08-12 17:13:41 · 387 阅读 · 0 评论