（枚举/网络流）Steady Cow Assignment

http://poj.org/problem?id=3189

题意为n头牛，m个牛棚，给出每头牛的牛棚喜爱度，给出每个牛棚的容量，求出所有牛选择的牛棚优先级最大和最小的差
由小到大枚举区间长度和区间左端点，建图跑出流量，若等于牛数即是答案。

#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cstdio>
#include <queue>
using namespace std;
const int maxn = 2e3 + 5;
const int INF = 0x3f3f3f3f;
struct Edge {
    int from, to, cap, flow;
    Edge(int u, int v, int c, int f) : from(u), to(v), cap(c), flow(f) {}
};
struct Dinic{
    int n, m, s, t;
    vector<Edge> edges;
    vector<int> g[maxn];
    bool vis[maxn];
    int d[maxn];
    int cur[maxn];
    void init(int n){
        this->n = n;
        for(int i = 0; i < n; i++) g[i].clear();
        edges.clear();
    }
    void AddEdge(int from, int to, int cap){
        edges.push_back(Edge(from, to, cap, 0));
        edges.push_back(Edge(to, from, 0, 0));
        m = edges.size();
        g[from].push_back(m - 2);
        g[to].push_back(m - 1);
    }
    bool Bfs(){
        memset(vis, 0, sizeof(vis));
        queue<int> q;
        q.push(s);
        d[s] = 0;
        vis[s] = 1;
        while(!q.empty()){
            int x = q.front(); q.pop();
            for(int i = 0; i < (int)g[x].size(); i++){
                Edge &e = edges[g[x][i]];
                if(!vis[e.to] && e.cap > e.flow){
                    vis[e.to] = 1;
                    d[e.to] = d[x] + 1;
                    q.push(e.to);
                }
            }
        }
        return vis[t];
    }
    int Dfs(int x, int a){
        if(x == t || a == 0) return a;
        int flow = 0, f;
        for(int& i = cur[x]; i < (int)g[x].size(); i++){
            Edge &e = edges[g[x][i]];
            if(d[x] + 1 == d[e.to] && (f = Dfs(e.to, min(a, e.cap - e.flow))) > 0){
                e.flow += f;
                edges[g[x][i]^1].flow -= f;
                flow += f;
                a -= f;
                if(a == 0) break;
            }
        }
        return flow;
    }
    int Maxflow(int s, int t){
        this->s = s; this->t = t;
        int flow = 0;
        while(Bfs()){
            memset(cur, 0, sizeof(cur));
            flow += Dfs(s, INF);
        }
        return flow;
    }
} dinic;
int a[maxn][50], cap[50];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j) cin >> a[i][j];
    for(int i = 1; i <= m; ++i) cin >> cap[i];
    for(int k = 1; k <= m; ++k) {
        for(int l = 1; l + k - 1 <= m; ++l) {
            dinic.init(n + m + 1);
            for(int i = 1; i <= n; ++i) dinic.AddEdge(0, i, 1);
            for(int i = 1; i <= m; ++i) dinic.AddEdge(n + i, n + m + 1, cap[i]);
            for(int i = 1; i <= n; ++i) {
                for(int j = l; j <= l + k - 1; ++j) {
                    dinic.AddEdge(i, n + a[i][j], 1);
                }
            }
            if(dinic.Maxflow(0, n + m + 1) == n) {
                cout << k << endl;
                return 0;
            }
        }
    }
}