2016年7月14日
codeforces 360 C
摘要： C - NP-Hard Problem Description Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very 阅读全文
posted @ 2016-07-14 21:47 枫虹 阅读(198) 评论(0) 推荐(0) 编辑