Network streaming problem __ACM the wind of summer

"Hdu"
1532Drainage ditches (base) [Max Flow]
3549 Flow Problem (base) [Max Stream]
3572 task Schedule [Max Stream] assignment to determine full flow
2732 Leapin ' lizards (difficult) [Max Flow]
3338 Kakuro Extension [max Flow] [number and] Magic Max popularity list
2883 kebab [Max Stream] to judge full flow
3605 Escape [Maximum flow] (multiple matches)
4183 Pahom on Water [maximum flow] to and fro a network stream that does not repeat points.
4240 Route redundancy [Max Stream] A stream's largest path
3081 marriage Match II [binary maximum flow]+ and look-up set
3277 marriage Match III [binary maximum flow] ditto, multiple split.
3416 marriage Match IV [maximum current] shortest path + maximum flow
2485 destroying the bus stations [maximum current] shortest path + maximum flow
3468 treasure hunting [Maximum current] (binary match) + shortest circuit
3998 Sequence (difficult) [dp+ maximum flow] the longest ascending subsequence
4309 Seikimatsu occult Tonneru [Max Stream] enum State + maximum stream
3472 HS BDC [mixed Euler]
----------------------------------------------------------------------------------------------
1533 going Home (base) [cost stream]
3488 Tour [Cost flow] Circle
3435 A New Graph Game [cost flow] Circle
1853 cyclic Tour [cost flow] ring
2686 Matrix [Cost Stream]
3376 Matrix Again [cost Stream]
3667 transportation [fee flow] Split
3315 my brute [fee flow] (available km)
3395 Special Fish [cost Stream] (available km matching)
2448 Mining Station on the sea [cost stream] (available shortest path +km match)
4067 Random Maze (difficult) [cost flow]
3947 River Problem (difficult) [cost flow] magic cost flow, flow inequality building map
---------------------------------------------------------------------------------------------
3046 pleasant sheep and big Wolf [min Cut]
1565 square Number (1) [min Cut]
1569 square number (2) [min Cut]
3820 Golden Eggs [min Cut] squares strengthened
3491 thieves [min Cut] minimum point cut set
3657 Game [min Cut] Maximum point weight independent set
3313 Key Vertex [min Cut]
3251 being a Hero [min Cut]
3452 Bonsai [min Cut] a tree with a right edge, the smallest cut root and leaf node is not connected
3987 Harry Potter and the Forbidden Forest [min Cut] minimum cut, ask for the minimum number of edges to be cut off.
2435 There is a war [min Cut] build Invincible bridge
3917 Road Constructions [maximum power closure] maximum profit
3879 Base Station [maximum right closure] maximum profit
3061 Battle [maximum right closure] maximum profit
3996 Gold Mine [maximum right closure] maximum profit

4307 Matrix [min Cut] Project assignment problem

4265 science!

4289 control [Minimum dot rights override]

4292 Food

4322 Candy ===================================================================================================== ===
"POJ"
1087 A Plug for UNIX [Max Stream] (available for binary matching)
1274 the Perfect stall [maximum flow] (available in binary match)
1325 Machine Schedule [Max Stream] (available binary match)
1698 Alice ' s Chance [maximum flow] (available for binary matching)
2239 selecting courses [Max Stream] (available binary match)
2446 chessboard [Max Stream] (available binary matching) good question.
2536 Gopher II [maximum flow] (usable binary match)
2771 Guardian of decency [maximum current] Two-point matching maximum independent set
3041 asteroids [Maximum flow] (simple two-point match)
2584 T-Shirt Gumbo [Maximum current] (multiple matching)
3189 Steady Cow Assignment (medium) [two-point maximum flow] (multiple matching)

1149 PIGS [Max Stream] Absolute Classic composition problem
1273 drainage ditches [maximum flow] (base)
1459 Power Network (base) [Max Flow]
3281 dining [Max Flow]
2112 Optimal Milking (base) [two-point maximum flow]
2289 Jamie ' s contact Groups [max flow of two points]
2391 ombrophobic bovines (medium) [two-point maximum flow]
2455 Secret Milking Machine (base) [two-point maximum flow]
3228 Gold Transportation [binary maximum flow] (and check set)
2699 the Maximum number of strong Kings (more difficult) [Enumerator + max Flow]
3498 March of the Penguins (medium) [Max Stream] Enumerate the meeting points to meet the network flow with dot capacity limit
1637 Sightseeing Tour (crazy) [mixed Euler]
-------------------------------------------------------------------------------------------------------
2135 Farm Tour [cost Stream] (shortest-back)
2175 Evacuation Plan (medium) [fee flow] extinction ring
2195