wineandchord

网络流的模板题。// EK algorithm 复杂度 O(NM^2)// 整体思路是通过不断地bfs找增广路径，然后通过增广路径扩充最大流#include<iostream>#include<cstdio>#include<cstring>#include<queue>#define MAXN 250#define MAXM 10010#define INF 0x3f3f3f3fusing namespace std;typedef l

建模为最大流，源点为 000 ，试题为 1∼n1\sim n1∼n，类型为 n+1∼n+kn+1\sim n+kn+1∼n+k，终点为 n+k+1n+k+1n+k+1，然后跑最大流算法即可。#include<iostream>#include<cstdio>#include<queue>#include<cstring>#define MAXN 1100#define MAXM 20100#define INF 0x3f3f3f3fusing