2018年9月8日

ACM-ICPC 2018 沈阳赛区网络预赛 F. Fantastic Graph (贪心或有源汇上下界网络流)

摘要： "Oh, There is a bipartite graph.""Make it Fantastic."X wants to check whether a bipartite graph is a fantastic graph. He has two fantastic numbers, an 阅读全文

posted @ 2018-09-08 21:39 大桃桃 阅读(390) 评论(0) 推荐(0)

HDU 3251 Being a Hero(最小割+输出割边)

摘要： Problem DescriptionYou are the hero who saved your country. As promised, the king will give you some cities of the country, and you can choose which o 阅读全文

posted @ 2018-09-08 11:35 大桃桃 阅读(225) 评论(0) 推荐(0)

导航