//最短增广路,Dinic算法 struct Edge { int from,to,cap,flow; };//弧度 void AddEdge(int from,int to,int cap) //增弧 { edges.push_back((Edge){}); edges.push_back((Edge){to,,}); m=edges.size(); G[); G[to].push_back(m-); } struct Dinic{ int n,m,s,t; vector<Edge> edg…