![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
带花树
wtcl
这个作者很懒,什么都没留下…
展开
-
牛客多校 - 1 or 2(一般图最大匹配)
讲解:https://blog.csdn.net/qq_45458915/article/details/107306393代码:#include<cstdio>#include<cctype>#include<cstring>#include<algorithm>using namespace std;const int maxn=505;const int maxm=maxn*maxn*2;int que[maxm],ql,qr,pre[原创 2020-07-14 15:12:16 · 207 阅读 · 1 评论 -
一般图最大匹配(带花树)
讲解:https://www.cnblogs.com/owenyu/p/6858508.htmlhttps://yhx-12243.github.io/OI-transit/records/uoj79.htmlhttps://www.cnblogs.com/BAJimH/p/10569418.html题目:http://uoj.ac/problem/79#include<cstdio>#include<cctype>#include<cstring>#in原创 2020-07-14 14:48:15 · 239 阅读 · 0 评论