2017年7月15日

hdu1533 Going Home 最小费用最大流 构造源点和汇点

摘要： Going Home Problem Description 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 h 阅读全文

posted @ 2017-07-15 17:13 hnust_accqx 阅读(273) 评论(0) 推荐(0)

poj1273 Drainage Ditches Dinic最大流

摘要： Drainage Ditches Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 76000 Accepted: 29530 Description Every time it rains on Farmer John's fie 阅读全文

posted @ 2017-07-15 10:44 hnust_accqx 阅读(140) 评论(0) 推荐(0)

导航