poj-2112-Optimal Milking

源点s与牛 相连，权值为1，，机器与汇点相连，权值为m；

二分答案，x，牛与机器之间的点，权值小于x的边连接，权值为1，

构图完毕，求最大流，如果等于牛的个数，则x合法。。

#include<stdio.h>  
#include<string.h>  
#include<queue>  
#include<vector>  
#include<algorithm>  
#include<iostream>
using namespace std;  

const int maxnode = 250;
const int maxedge = 62500;
const int oo = 1000000000;
int node, src, dest, nedge;
int head[maxnode], point[maxedge], next1[maxedge], flow[maxedge], capa[maxedge];//point[x]==y表示第x条边连接y，head，next为邻接表，flow[x]表示x边的动态值，capa[x]表示x边的初始值
int dist[maxnode], Q[maxnode], work[maxnode];//dist[i]表示i点的等级
void init(int _node, int _src, int _dest){//初始化，node表示点的个数，src表示起点，dest表示终点
    node = _node;
    src = _src;
    dest = _dest;
    for (int i = 0; i < node; i++) head[i] = -1;
    nedge = 0;
}
void addedge(int u, int v, int c1, int c2){//增加一条u到v流量为c1，v到u流量为c2的两条边
    point[nedge] = v, capa[nedge] = c1, flow[nedge] = 0, next1[nedge] = head[u], head[u] = (nedge++);
    point[nedge] = u, capa[nedge] = c2, flow[nedge] = 0, next1[nedge] = head[v], head[v] = (nedge++);
}
bool dinic_bfs(){
    memset(dist, 255, sizeof (dist));
    dist[src] = 0;
    int sizeQ = 0;
    Q[sizeQ++] = src;
    for (int cl = 0; cl < sizeQ; cl++)
        for (int k = Q[cl], i = head[k]; i >= 0; i = next1[i])
            if (flow[i] < capa[i] && dist[point[i]] < 0){
                dist[point[i]] = dist[k] + 1;
                Q[sizeQ++] = point[i];
            }
    return dist[dest] >= 0;
}
int dinic_dfs(int x, int exp){
    if (x == dest) return exp;
    for (int &i = work[x]; i >= 0; i = next1[i]){
        int v = point[i], tmp;
        if (flow[i] < capa[i] && dist[v] == dist[x] + 1 && (tmp = dinic_dfs(v, min(exp, capa[i] - flow[i]))) > 0){
            flow[i] += tmp;
            flow[i^1] -= tmp;
            return tmp;
        }
    }
    return 0;
}
int dinic_flow(){
    int result = 0;
    while (dinic_bfs()){
        for (int i = 0; i < node; i++) work[i] = head[i];
        while (1){
            int delta = dinic_dfs(src, oo);
            if (delta == 0) break;
            result += delta;
        }
    }
    return result;
}
//建图前,运行一遍init()；
//加边时，运行addedge(a,b,c,0),表示点a到b流量为c的边建成（注意点序号要从0开始）
//求解最大流运行dinic_flow(),返回值即为答案

int map[250][250];
int k,c,m,n;
bool check(int x)
{
	init(n+2,0,n+1);
	int i,j;
	for(i=1;i<=k;i++)
		addedge(i,n+1,m,0);
	for(i=k+1;i<=n;i++)
		addedge(0,i,1,0);
	for(i=k+1;i<=n;i++)
		for(j=1;j<=k;j++)
			if(map[i][j]<=x)
				addedge(i,j,1,0);
	int ans=dinic_flow();
	if(ans==c) return true;
	else return false;
}
int main()  
{  
    int i,j,l;
	cin>>k>>c>>m;
	n=k+c;
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
		{
			int tt;
			scanf("%d",&tt);
			if(tt==0)
				map[i][j]=99999999;
			else
				map[i][j]=tt;
		}
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			for(l=1;l<=n;l++)
				map[j][l]=min(map[j][l],map[j][i]+map[i][l]);
	int le=0,ri=99999999;
	while(le<ri)
	{
		int mid=(le+ri)/2;
		if(check(mid)) ri=mid;
		else le=mid+1;
	}
	cout<<ri<<endl;
	//system("pause");  
}