唐宋元明清201712151935887

分类

dp(15) h(10) kmp(1) 二分(4) 匹配(1) 图论(45) 大水题~~(7) 数据结构(3) 未归档(123) 杂乱的一坨(2) 树形结构(10) 简单搜索(6) 题解(1) 高精度(1)

/ 注册

全部文章（共229篇）

HDU - 4280 Island Transport （双向图中最大流）

In the vast waters far far away, there are many islands. People are living on the islands, and all the transport among the islands relies on the ships...

2018-08-08

0 396

POJ - 2516 Minimum Cost （最小费用最大流）

Minimum Cost Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 18305 Accepted: 6465 Descriptio...

2018-08-08

0 462

最小费用最大流的模板spfa

#include<iostream> #include<cstdio> #include<queue> #include<algorithm> using namespace std; const int maxn = 100005; const in...

2018-08-08

0 407

POJ - 2195 Going Home （最小费用最大流）

Going Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 25156 Accepted: 12597 Description...

2018-08-08

0 534

POJ - 3436 ACM Computer Factory （拆点+网络流）

ACM Computer Factory Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9241 Accepted: 3412 ...

2018-08-08

0 502

POJ - 3281 Dining （拆点+dinic最大流）

Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 22184 Accepted: 9851 Description Cow...

2018-08-07

0 411

Dinic+弧优化模板

#include<iostream> #include<cstdio> #include<cstring> #include<queue> #include<algorithm> using namespace std; #define i...

2018-08-07

0 372

HDU - 3488 Tour（KM）

In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You are lucky enough to have...

2018-08-07

0 397

POJ - 2112 Optimal Milking（floyd传递闭包+二分枚举+二分图多重匹配）

Optimal Milking Time Limit: 2000MS Memory Limit: 3000...

2018-08-06

0 407

POJ - 3189 Steady Cow Assignment（二分+二分图多重匹配）

Steady Cow Assignment Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7289 Accepted: 2506 De...

2018-08-06

0 403