Going Home 网络流(最小费用最大流MCMF)
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, to an adjacent point. For each little man, you need t...
原创
2020-02-21 20:15:17 ·
245 阅读 ·
0 评论