摘要：
数目规模大,尝试转换为判定性问题,那么E就不影响到网络流的复杂度了 SPFA码歪了,WA了好几发气死了 C++ include using namespace std; const int maxn = 3e5+11; const int oo = 0x3f3f3f3f; int to[maxnf) 阅读全文
posted @ 2017-11-29 21:45
Caturra
阅读(216)
评论(0)
推荐(0)
摘要：
Let’s move from initial matrix to the bipartite graph. The matrix elements (i, j) for which i + j are even should be place to one part, the matrix ele 阅读全文
posted @ 2017-11-29 20:07
Caturra
阅读(187)
评论(0)
推荐(0)
摘要：
按边建模，二叉树一条入边两条出边 判断就要用到mcmf的好处了 阅读全文
posted @ 2017-11-29 17:22
Caturra
阅读(278)
评论(0)
推荐(0)
摘要：
没啥好说的 C++ include include include include using namespace std; const int maxn = 1e5+11; const int oo = 0x3f3f3f3f; int to[maxnf&&dis[v] dis[u]+w){ dis 阅读全文
posted @ 2017-11-29 16:44
Caturra
阅读(155)
评论(0)
推荐(0)
摘要：
```C++ include using namespace std; const int maxn = 1e5+11; const int oo = 0x3f3f3f3f; typedef long long ll; ll cost[maxnf&&dis[v] dis[u]+w){ dis[v]= 阅读全文
posted @ 2017-11-29 00:46
Caturra
阅读(946)
评论(0)
推荐(0)
浙公网安备 33010602011771号