2016年6月5日
【POJ2699】The Maximum Number of Strong Kings(网络流)
摘要： Description A tournament can be represented by a complete graph in which each vertex denotes a player and a directed edge is from vertex x to vertex y 阅读全文
posted @ 2016-06-05 09:59 konjak魔芋 阅读(248) 评论(0) 推荐(0) 编辑