2017年12月20日
luogu3376 【模板】网络最大流 dinic
摘要： 当前弧优化 cpp include include include include using namespace std; int n, m, ss, tt, hea[10005], cnt, uu, vv, ww, maxFlow, cur[10005]; int lev[10005]; con 阅读全文
posted @ 2017-12-20 19:26 poorpool 阅读(200) 评论(0) 推荐(0) 编辑
luogu2740 [USACO4.2]草地排水Drainage Ditches 最大流EK
摘要： 练一下最大流 cpp include include include include using namespace std; int n, m, ron[205][205], pre[205], uu, vv, ww, vis[205]; queue d; int ek(){ int maxFlo 阅读全文
posted @ 2017-12-20 11:09 poorpool 阅读(128) 评论(3) 推荐(0) 编辑
luogu2577 [ZJOI2005]午餐
摘要： dp[i]表示第一队打饭时间i的最优解 cpp include include include include using namespace std; struct Node{ int aa, bb; }nd[205]; int n, sum[205], dp[40005], ans=0x3f3f 阅读全文
posted @ 2017-12-20 09:39 poorpool 阅读(102) 评论(0) 推荐(0) 编辑