2016年2月26日
OPTM-Optimal Marks-SPOJ839最小割
摘要： You are given an undirected graph G(V, E). Each vertex has a mark which is an integer from the range [0..231 – 1]. Different vertexes may hav... 阅读全文
posted @ 2016-02-26 11:42 一骑绝尘去 阅读(203) 评论(0) 推荐(0) 编辑
Network Wars-ZOJ2676最小割+01规划
摘要： Time Limit: 5 Seconds Memory Limit: 32768 KB Special JudgeNetwork of Byteland consists of n servers, connected by m optical cables. Each ... 阅读全文
posted @ 2016-02-26 09:30 一骑绝尘去 阅读(227) 评论(0) 推荐(0) 编辑