
网络流
NineFailure
这个作者很懒,什么都没留下…
展开
-
HDU3549 ISAP板子题
#include <bits/stdc++.h>using namespace std;const int inf = 0x3fffffff;template <int N, int M>struct Isap{ int top; int d[N], pre[N], cur[N], gap[N]; struct Vertex { int head;原创 2016-12-11 21:35:54 · 367 阅读 · 0 评论 -
HDU4280
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. You have a transportation company there. Some原创 2017-03-30 13:39:46 · 522 阅读 · 0 评论 -
HDU4292 水题..
You, a part-time dining service worker in your college’s dining hall, are now confused with a new problem: serve as many people as possible. The issue comes up as people in your college are more an原创 2017-03-31 17:13:11 · 475 阅读 · 0 评论 -
HDU4289 水题...
You, the head of Department of Security, recently received a top-secret information that a group of terrorists is planning to transport some WMD 1 from one city (the source) to another one (the destina原创 2017-03-31 17:58:59 · 382 阅读 · 0 评论 -
UVA10480 打印最大流割掉了哪条边..
记录一下新的板子#include<iostream> #include<stdio.h> #include<stdlib.h> #include<string.h> #include<math.h> #include<vector> #include<queue> #include<map> #include<set> #include<string> #in原创 2017-04-01 21:58:14 · 584 阅读 · 0 评论 -
HDU2732 最大流..
Your platoon of wandering lizards has entered a strange room in the labyrinth you are exploring. As you are looking around for hidden treasures, one of the rookies steps on an innocent-looking stone an原创 2017-04-03 22:47:04 · 454 阅读 · 0 评论 -
poj2135(84/600)
When FJ’s friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of which contains th原创 2017-08-09 13:29:23 · 294 阅读 · 0 评论