随笔分类 -  图论---网络流

2018ACM-ICPC南京区域赛---AJGIDKM
摘要：含【最小球覆盖】【最大流isap】模板。 题面pdf https://codeforc.es/gym/101981/attachments/download/7891/20182019-acmicpc-asia-nanjing-regional-contest-en.pdf G Pyramid【数论 阅读全文
posted @ 2018-11-17 23:11 wyboooo 阅读(1953) 评论(0) 推荐(0)
poj3585 Accumulation Degree【树形DP】【最大流】
摘要：Accumulation Degree Time Limit: 5000MS Memory Limit: 65536K Total Submissions:3151 Accepted: 783 Description Trees are an important component of the n 阅读全文
posted @ 2018-10-09 20:18 wyboooo 阅读(246) 评论(0) 推荐(0)
沈阳网络赛F-Fantastic Graph【贪心】or【网络流】
摘要："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, a 阅读全文
posted @ 2018-09-13 16:27 wyboooo 阅读(202) 评论(0) 推荐(0)
网络流
摘要：优秀博客参考：http://www.cnblogs.com/Booble/archive/2011/03/04/1970453.htmlhttps://blog.csdn.net/A_Comme_Amour/article/details/79356220 给定指定的... 阅读全文
posted @ 2018-09-13 09:15 wyboooo 阅读(904) 评论(0) 推荐(0)
hdu 2444 The Accomodation of Students 【二分图匹配】
摘要：There are a group of students. Some of them may know each other, while others don't. For example, A and B know each other, B and C know each other. Bu 阅读全文
posted @ 2017-10-10 20:18 wyboooo 阅读(93) 评论(0) 推荐(0)