poj3281-最大流(二)

2014-11-24 09:25:51 · 作者: · 浏览: 1
+ N] = 1;
for (int j = 0; j < dNum; ++ j)
{
scanf("%d", &fd);
map[fd + 2 * N + F][F + 2 * N + D + 1] = 1;
map[i + F + N][fd + 2 * N + F] = 1;
}
}
Edmods_Karp();
}
}
//注意这里给点编号,0-源点,1-F是食物,F+1-F+N是牛左点,F+N+1-F+N+N是牛右点,F+N+N+1-F+N+N+D是drink饮料点,F+N+N+D+1是汇点

int main()
{
buildMap();
return 0;
}