费用流
peter_zhu01
你不要看别人做什么,10个漫评9个吐槽,你就做你擅长,做剩下的那一个。
展开
-
poj_3422_Kaka's Matrix Travels
DescriptionOn an N × N chessboard with a non-negative number in each grid, Kaka starts his matrix travels with SUM = 0. For each travel, Kaka moves one rook from the left-upper grid to the right-bottom原创 2017-03-21 17:35:59 · 301 阅读 · 0 评论 -
zoj_2587_Unique Attack
题意:给定一个无向图,要求判定分离两个点的最小割是否唯一。解法:在求出最大流的基础上,从源点进行一次搜索,搜索按照未饱和的边进行,得到顶点子集S的顶点个数;再从汇点反向搜索未饱和的边,得到子集T的顶点个数,判定顶点数相加是否等于总共的顶点数。原创 2017-03-24 20:26:30 · 272 阅读 · 0 评论 -
poj——1273 Drainage Ditches(费用流模版)
DescriptionEvery time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow原创 2017-03-15 17:19:25 · 457 阅读 · 0 评论