米夏

关于ISAP:https://www.cnblogs.com/owenyu/p/6852664.html同时也是poj1273 / codevs1993的题解USACO的奶牛题，网络流模板这道题codevs上的数据很水...还要注意poj上是多组数据//poj1273 / codevs1993#include <queue>#include <cstdi...

//hdu3667#include <bits/stdc++.h>using namespace std;typedef long long ll;const ll MAXN = 100 + 5;const ll INF = 0x3f3f3f3f3f3f3f3f;const ll MAXM = 50000 + 5;//边数，要开成两倍ll fst[MAXN], ...

// UVa11419 SAM I AM// Rujia Liu#include <cstdio>#include <cstring>#include <vector>using namespace std;const int maxn = 1000 + 5; // 单侧顶点的最大数目// 二分图最大基数匹配struct BPM { ...

//zkw费用流#include <cstdio>#include <iostream>#include <cstring>using namespace std;const int MAXN = 20000 + 5;const int INF = 0x7f7f7f7f;int from[MAXN << 1], to[MAXN &l...