青山绿水之辈-CSDN博客

原创 HDU 2686 Matrix(最大费用流)

MatrixTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1890 Accepted Submission(s): 1005Problem DescriptionYifenfei very like play

2015-06-25 21:55:08 1255

原创 HDU 1853 Cyclic Tour（最小费用最大流）

Cyclic TourTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/65535 K (Java/Others)Total Submission(s): 1879 Accepted Submission(s): 938Problem DescriptionThere are N cities

2015-06-25 21:45:26 767

原创 HDU 3435 A new Graph Game（最小费用最大流）&HDU 3488

A new Graph GameTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1849 Accepted Submission(s): 802Problem DescriptionAn undirected

2015-06-25 14:09:33 1135

原创 HDU 3488 Tour (最小费用流或 KM)

TourTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2160 Accepted Submission(s): 1086Problem DescriptionIn the kingdom of Henryy,

2015-06-24 16:31:28 774

原创 HDU 1533 Going Home(最小费用流)

Going HomeTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3278 Accepted Submission(s): 1661Problem DescriptionOn a grid map ther

2015-06-23 22:33:02 1416

原创 HDU 4183 Pahom on Water(最大流SAP)

Pahom on WaterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 629 Accepted Submission(s): 288Problem DescriptionPahom on Water is

2015-06-23 20:50:53 851

原创 HDU 3277 Marriage Match III(并查集+二分答案+最大流SAP)拆点，经典

Marriage Match IIITime Limit: 10000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1581 Accepted Submission(s): 464Problem DescriptionPresumably,

2015-06-23 14:59:14 844

原创 CSU 1659: Graph Center（SPFA）

1659: Graph CenterTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 63 Solved: 25[Submit][Status][Web Board]DescriptionThe center of a graph is the set of all vertices of minimum eccentr

2015-06-22 17:32:05 769

原创 CSU 1663: Tree(树链剖分)

1663: TreeTime Limit: 5 Sec Memory Limit: 128 MBSubmit: 26 Solved: 11[Submit][Status][Web Board]DescriptionCSU has a lot of trees. But there is a tree which is different from the oth

2015-06-22 17:20:17 707

原创 HDU 3472 HS BDC（混合欧拉图（使用最大流））模板

HS BDCTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 980 Accepted Submission(s): 398Problem DescriptionIELTS is around the corne

2015-06-21 22:52:41 975

原创 HDU 4309 Seikimatsu Occult Tonneru(最大流SAP+状态压缩枚举)

Seikimatsu Occult TonneruTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2012 Accepted Submission(s): 523Problem DescriptionDuri

2015-06-21 13:50:48 870

原创 HDU5274 Dylans loves tree（树链剖分）很巧的点权更新

Dylans loves treeAccepts: 49Submissions: 262Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)问题描述Dylans有一棵N个点的树。每个点有点权。树上节点标号为1∼N。他得到了Q个询问，

2015-06-21 09:50:03 1604

原创 HDU 5272 Dylans loves numbers

Dylans loves numbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 58 Accepted Submission(s): 49Problem DescriptionWho is Dyla

2015-06-20 21:47:43 1040

原创 HDU 5273 Dylans loves sequence(区间DP)

Dylans loves sequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 114 Accepted Submission(s): 59Problem DescriptionDylans is

2015-06-20 21:45:27 1210

原创 CF E. Vanya and Brackets(添加一对括号使得表达式的值最大)

E. Vanya and Bracketstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVanya is doing his maths homework. He

2015-06-20 13:38:43 1372

原创 HDU 3998 Sequence （最长递增子序列+最大流SAP,拆点法）经典

SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1666 Accepted Submission(s): 614Problem DescriptionThere is a sequence X

2015-06-19 21:34:31 1037

原创 HDU 3468 Treasure Hunting (最大流SAP)经典（看似广搜实则最大流）

Treasure HuntingTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1532 Accepted Submission(s): 400Problem DescriptionDo you like t

2015-06-18 18:01:26 808

原创 CF Soldier and Traveling(最大流SAP)拆点法

E. Soldier and Travelingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the country there are n cities a

2015-06-18 12:46:49 781

原创 CF Soldier and Cards

C. Soldier and Cardstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo bored soldiers are playing card wa

2015-06-18 12:33:48 755

原创 HDU2485 Destroying the bus stations（最小割---点割）

Destroying the bus stationsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2319 Accepted Submission(s): 743Problem DescriptionGab

2015-06-17 15:59:23 1964

原创 HDU3416 Marriage Match IV(spfa+最大流SAP)

Marriage Match IVTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2391 Accepted Submission(s): 722Problem DescriptionDo not sincer

2015-06-16 17:48:54 1143

原创 CF ZgukistringZ

B. ZgukistringZtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputProfessor GukiZ doesn't accept string as th

2015-06-16 11:59:30 870

原创 HDU3081Marriage Match II(二分答案+并查集+最大流SAP)经典

Marriage Match IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2507 Accepted Submission(s): 856Problem DescriptionPresumably, y

2015-06-15 22:21:38 904

原创 HDU4240Route Redundancy(最大流SAP)

Route RedundancyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 440 Accepted Submission(s): 259Problem DescriptionA city is made

2015-06-15 12:33:32 684

原创 HDU3605Escape（最大流SAP+状态压缩优化点的个数）

EscapeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6239 Accepted Submission(s): 1474Problem Description2012 If this is the end

2015-06-14 20:57:34 1029

原创 HDU2883kebab（最大流ISAP）离散化思想建图

kebabTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1145 Accepted Submission(s): 472Problem DescriptionAlmost everyone likes keb

2015-06-14 10:17:54 885

原创 XTU1238Segment Tree(线段树)解题思想必较经典

Segment TreeAccepted : 9 Submit : 123Time Limit : 9000 MS Memory Limit : 65536 KBSegment TreeProblem Description:A contest is not integrity without prob

2015-06-14 08:12:28 942

原创 HDU3338Kakuro Extension（最大流，ISAP）建图是关键

Kakuro ExtensionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1144 Accepted Submission(s): 404Special JudgeProblem DescriptionI

2015-06-13 17:17:35 1376

原创 HDU2732Leapin' Lizards（最大流SAP，建图---折点法）

Leapin' LizardsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1531 Accepted Submission(s): 623Problem DescriptionYour platoon of

2015-06-12 17:04:44 969

原创 HDU3572Task Schedule(最大流 ISAP比较快)建图方法不错

Task ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5007 Accepted Submission(s): 1636Problem DescriptionOur geometry pri

2015-06-11 21:39:08 1160

原创 CF Mike and Feet （求连续区间内长度为i的最小值）单调栈

Mike and Feettime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike is the president of country What-The-Fath

2015-06-11 14:12:15 1136

原创 HDU3549Flow Problem（模板题）

Flow ProblemTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 9769 Accepted Submission(s): 4577Problem DescriptionNetwork flow is a

2015-06-10 20:47:51 789

原创 HDU 1532Drainage Ditches(最大流模板题 ISAP)

Drainage DitchesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11306 Accepted Submission(s): 5328Problem DescriptionEvery time i

2015-06-10 20:08:41 808

原创网络流模板（更新中）

最大流：性质：1. f(u,v)= - f(v,u) 2.流量守恒（即每个非源点s，非汇点t的点流入量=流出量） 3.源点的流出量=汇点的流入量4.最小割=最大流（C(S,T)：两个点集之间边的最小容量和）最大流共同的思想：先找增广流路径，再更新该路径上的边的残流（剩余流量）。/*最大流EK算法，O(V*E*E)算法思想：先找到一条可流的增广路P，再

2015-06-09 23:37:27 1012

原创 CF Regular Bridge()

D. Regular Bridgetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAn undirected graph is called k-regular,

2015-06-09 15:32:50 675

原创 hunnu 11545小明的烦恼——找路径 (最大流)

小明的烦恼——找路径 Time Limit: 2000ms, Special Time Limit:5000ms,Memory Limit:32768KBTotal submit users: 45, Accepted users:37Problem 11545 : No special judgementProblem descriptio

2015-06-08 22:39:24 870

原创 HDU5247找连续数（百度之星初赛）

找连续数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 677 Accepted Submission(s): 253Problem Description小度熊拿到了一个无序的数组，对于这个数组，小度熊想知道

2015-06-03 17:11:08 1360

原创 HDU5246 超级赛亚ACMer

超级赛亚ACMerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1286 Accepted Submission(s): 386Problem Description百小度是一个ACMer，也是一个超级赛亚人

2015-06-03 16:17:33 822

原创 HDU1028Ignatius and the Princess III（一个数有多少种组合方式,DP）与放n个苹果在m个盘子有多少生种组合一样(两种方法解)

Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15210 Accepted Submission(s): 10724Problem Description

2015-06-03 14:33:51 2372

原创 CSU1655: 文本计算器

1655: 文本计算器Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 58 Solved: 16[Submit][Status][Web Board]DescriptionBob讨厌复杂的数学运算.看到练习册上的算术题,Bob很是头痛.为了完成作业,Bob想要你帮忙写一个文本版的四则运算计算器.这个计算器的功能需

2015-05-31 18:35:20 916