2015年3月12日
hdu 2686 Matrix 最小费用最大流
摘要： 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2686Yifenfei very like play a number game in the n*n Matrix. A positive integer number is put in each a... 阅读全文
posted @ 2015-03-12 12:11 huangxf 阅读(512) 评论(0) 推荐(0) 编辑
hdu 1533 Going Home 最小费用最大流
摘要： 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1533On a grid map there are n little men and n houses. In each unit time, every little man can move one... 阅读全文
posted @ 2015-03-12 01:37 huangxf 阅读(1358) 评论(0) 推荐(1) 编辑