[最大流]poj 2112 ptimal Milking#floyd+二分+最大流

/**
[最大流]poj 2112 ptimal Milking#floyd+二分+最大流
关键还是最大流，二分最大距离
源点到牛的边为1，牛到可达的机器建边权为1，机器到汇点建边权为m，
满足条件为最大流为c
*/
#include <stdio.h>
#include <string.h>

#define N 256
#define INF 500000
int k,c,m,d[N][N],s = 0,t;

typedef int typec;
#define E 1100001
// type of cost
const int inf = 10000000;
// max of cost
struct edge { int x, y, nxt; typec c; } bf[E];
int ne, head[E], cur[E], ps[E], dep[E];
void addedge(int x, int y, typec c)
{
// add an arc(x -> y, c); vertex: 0 ~ n-1;
    bf[ne].x = x; bf[ne].y = y; bf[ne].c = c;
    bf[ne].nxt = head[x]; head[x] = ne++;
    bf[ne].x = y; bf[ne].y = x; bf[ne].c = 0;
    bf[ne].nxt = head[y]; head[y] = ne++;
}
typ