----网络流
这个好玩吗
Offer已在路上请耐心等待,准备入职的新人
展开
-
POJ - 1273 Drainage Ditche
最大流模版题,练习一下// 网络流#include <cstdio>#include <vector>#include <string.h>#include <queue>#define MAX 500#define INF 0x3fffffffusing namespace std;int c[MAX][MAX];int f...原创 2017-05-23 15:38:36 · 315 阅读 · 0 评论 -
HDU - 3549 Flow Problem
#include #include #include #include #include #define MAX 500#define INF 0x3fffffffusing namespace std;int c[MAX][MAX];int flow[MAX];int pre[MAX];int n, m;void init( int n ) { memse原创 2017-05-23 15:40:19 · 247 阅读 · 0 评论 -
POJ - 2135 Farm Tour
就是从1走到n然后再走回来,一条边只能走一次,要求路径最短。// MCMF 最小费用最大流#include <cstdio>#include <vector>#include <string>#include <string.h>#include <queue>#define MAX 1000 + 5#define INF...原创 2017-05-23 15:41:46 · 336 阅读 · 0 评论 -
HDU-1532 Drainage Ditches
Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Fa...原创 2018-05-03 23:08:19 · 181 阅读 · 0 评论 -
HDU-1533 Going Home
On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little man, you need t...原创 2018-05-03 23:10:22 · 302 阅读 · 0 评论