Going Home （最小费用最大流）
题目链接:https://cn.vjudge.net/contest/308879#problem/A
On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically,...
原创
2019-07-04 17:38:07 ·
561 阅读 ·
0 评论
关注
分享
扫一扫