Pei_1997的博客

不分析了，这题主要是记一个错误,DEBUG了一个小时 (f=dfs(e.to,min(a,e.cap-e.flow))>0)) (f=dfs(e.to,min(a,e.cap-e.flow)))>0) #include #include #include #include #include #include #include #include #include

There are N cities, and M directed roads connecting them. Now you want to transport K units of goods from city 1 to city N. There are many robbers on the road, so you must be very careful. The more go

题目分析：网络流求最小割的模板题，难点在于求出最小割集。求出最小割集的方法是在求网络流之后跑一遍BFS对能够跑到的点进行标记（能跑到表示该点与起点处于同一割点集），然后遍历边，则最小割边即于起点被标记，终点没被标记的边，去重依次输出即可。 #include #include #include #include #include #include #include #include #includ