尽吾之力，以达天际

/*求最小值就把权值全部取相反数，继续套这个最大值的模板*/ #include <iostream>#include<cstring>#include<cstdio>#include<cmath>const int maxn = 101;const int INF = (1<<31)-1;int w[maxn][maxn];int lx[maxn],ly[maxn]; //顶标in

#include <cstdio>#include <vector>#include <cstring>#define maxn 1000#define INF 0x3fusing namespace std;/* 设在残量网络中节点u到源点s的距离为dist[u] 只保留每个点出发到dist+1的边（边(u,v)存在仅当dist[u]+1=dist[v]） */str

#include <iostream>#include<cstring>#include<cstdio>#include<cmath>#define maxn 1000using namespace std;int nx,ny,match[maxn];bool vis[maxn],w[maxn][maxn];bool find(int x){ for(int i=1;i<=n

#include <queue>#include <vector>using namespace std;//Kruskalstruct edge{ int from,to,val;}e[maxn];bool operator < (const edge&a,const edge&b){ return a.val<b.val;//边按边权排序 }int find(int a