2013年3月9日
poj 2195 (最小费用最大流)
摘要： 赤裸裸的最小费用最大流，不过话说KM 算法当然也可以搞定。Going HomeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 14859Accepted: 7604DescriptionOn 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 e 阅读全文
posted @ 2013-03-09 15:26 chenhuan001 阅读(167) 评论(0) 推荐(0) 编辑
hdu 1084(水题)
摘要： 10分钟左右A了... What Is Your Grade?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6195Accepted Submission(s): 1867Problem Description“Point, point, life of student!”This is a ballad（歌谣）well known in colleges, and you must care about your sc... 阅读全文
posted @ 2013-03-09 10:15 chenhuan001 阅读(186) 评论(0) 推荐(0) 编辑