- 博客(21)
- 资源 (2)
- 收藏
- 关注
RSS订阅
转载 一些图论、网络流入门题总结、汇总
最短路问题此类问题类型不多，变形较少POJ 2449 Remmarguts' Date(中等)http://acm.pku.edu.cn/JudgeOnline/problem?id=2449题意：经典问题：K短路解法：dijkstra+A*(rec)，方法很多相关：http://acm.pku.edu.cn/JudgeOnline/showcontest?cont
2011-08-31 18:37:33
1587
3
转载 网络流题目集锦
橙色的链接表示A掉了，转向我的题解。。。转载自 分享最终编辑 acmcs最大流 POJ 1273 Drainage Ditches POJ 1274 The Perfect Stall (二分图匹配) POJ 1698 Alice's Chance POJ 1459 Power Network POJ 2112 Optimal Milki
2011-08-31 18:36:39
1073
原创 我的模板 最大流（Dinic & Isap）+最小费用最大流（SPFAFlow）==有更改
今天刻意用poj 3469 http://poj.org/problem?id=3469测了下模板，Isap并不像想象中那么快，难道是我写搓了，而且在网络流与线性规划中的最后一题，isap完败给Dinic了,我的Isap啊~~~不知道那些几百毫秒出解的是用什么算法。。。难道是。。。 dinic总体上挺不错的，递归版的Isap基本上与Dinic没差别，而非递归版在某些情况反而不如递归版，于是
2011-08-10 15:16:52
4573
7
原创 囧——线性规划与网络流24题之网络流入门经典
搞了好久终于搞定线性规划与网络流24题，不过机器人路径至今无解，第22题感觉是数据错了~~~我的代码，数据和题目题解是BYVoid那弄到的：http://download.csdn.net/source/3499468
2011-08-06 17:10:00
1505
原创 poj 1459(最大流)
Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 15535 Accepted: 8268Description
2011-08-31 20:51:52
844
原创 poj 1698(最大流)
Alice's ChanceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2493 Accepted: 1098Description
2011-08-31 19:46:22
2058
原创 poj 2060(最小路径覆盖)
Taxi Cab SchemeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4207 Accepted: 1750Description
2011-08-31 18:24:18
699
原创 hdu 3991（最小路径覆盖）
Harry Potter and the Present IITime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1
2011-08-31 17:01:24
988
原创 hdu 3987(求边最少的最小割)
Harry Potter and the Forbidden ForestTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission
2011-08-31 16:52:55
1112
原创 hdu 3986 (枚举+最短路)
Harry Potter and the Final BattleTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s):
2011-08-31 16:41:57
1108
2
原创 hdu 3061Battle(最大流最小割的应用)
BattleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 398 Accepted Submission
2011-08-31 14:26:53
1160
原创 hdu 2883(最大流)
kebabTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 195 Accepted Submission(
2011-08-30 21:05:39
1140
原创 poj 2396(有上下界的可行流)
BudgetTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 3250 Accepted: 1227 Special JudgeDes
2011-08-28 19:22:44
964
原创 hust 1342 (有上下界的最小流)
Cheat SecretlyTime Limit: 1 Sec Memory Limit: 128 MBSubmissions: 269 Solved: 77DescriptionHH Big Cow(HBC) has taken part in an i
2011-08-28 14:01:57
996
原创 sug176 Flow construction （有上下界最小流）
176. Flow constructiontime limit per test: 1 sec.memory limit per test: 4096 KBinput: standardoutput: standardYou have giv
2011-08-12 20:56:05
1093
原创 sug438 The Glorious Karlutka River =)(枚举+最大流)
438. The Glorious Karlutka River =)Time limit per test: 1 second(s)Memory limit: 262144 kilobytesinput: standardoutput: standard
2011-08-09 10:09:45
1008
原创 hdu 2732（最大流）
Leapin' LizardsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 208 Accepted S
2011-08-08 18:47:00
990
原创 poj 3469（最大流最小割）
Dual Core CPUTime Limit: 15000MS Memory Limit: 131072KTotal Submissions: 10776 Accepted: 4533Case Time Limit:
2011-08-08 17:34:51
785
原创 hust 1024（二分+最大流）
dance partyTime Limit: 2 Sec Memory Limit: 128 MBSubmissions: 374 Solved: 136DescriptionYou are organizing a dance party. The pa
2011-08-08 16:10:36
1451
2
原创 hdu 3046
Pleasant sheep and big big wolfTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8
2011-08-08 13:52:56
893
原创 hdu 1733（枚举+最大流）
EscapeTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 521 Accepted Submission
2011-08-08 12:14:19
942
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人