世界真的很大
网络流一般是有向图,但无向图的情况还是有的
建图方法其实也差不多
先看一下题:
description
一个犯罪团伙打算去偷一家美术馆,警察决定派K个人堵住所有从匪窝通向美术馆的道路,不过他们只能驻守在沿途顶点处而不能在匪窝或美术馆,且每个点都有一个需要警察驻守的最低人数Ri。问警察是否能完成任务。 N<=100 M<=10000
input
The first line of the input contains a single integer 0 < K ≤ 10000 — the number of policemen engaged to control the stations.
The second line has four integers: N, M, S and F delimited with white-space character.
N is the number of stations in the galaxy (the stations are numbered from 1 to N); 2 < N ≤ 100.
M is the number of telep