摘要:
参考 "这里" cpp include include include using namespace std; typedef long long ll; int n, m, ise[100005], fa[100005][19], dep[100005], uu, vv, ww, hea[100 阅读全文
posted @ 2018-04-08 19:14
poorpool
阅读(247)
评论(0)
推荐(0)
摘要:
拆点。 cpp include include include include using namespace std; int n, m, hea[2005], cnt, ss, tt, uu, vv, maxFlow, ans, lev[2005]; const int oo=0x3f3f3f3 阅读全文
posted @ 2018-04-08 15:39
poorpool
阅读(1468)
评论(0)
推荐(0)
摘要:
二分图的(不)可行边。 cpp include include include include include using namespace std; int n, m, T, ss, tt, hea[20005], cnt, uu[100005], vv[100005], cur[20005], 阅读全文
posted @ 2018-04-08 11:28
poorpool
阅读(454)
评论(0)
推荐(0)
摘要:
最小路径可重点覆盖。先传递闭包,然后拆点,$n $最大匹配,看算法竞赛进阶指南。 cpp include include include using namespace std; int n, m, uu, vv, mat[205], ans; bool w[205][205], vis[205]; 阅读全文
posted @ 2018-04-08 09:20
poorpool
阅读(200)
评论(0)
推荐(0)