年度博客排行
-
第1名
青否云后端云 -
第2名
zw7534313 -
第3名
大家都说我很棒 - liyihz2008
- wy_19921005
- gengyun12
- hbxflihua
- e_e
- luxurioust
- dbagirl
- zysnba
- Alsmile
- robotmen
- gaozzsoft
- jywhltj
- cpongo1
- leslie26
- qepwqnp
- zhangdaiscott
- 解宜然
- cuityang
- sichunli_030
- gashero
- fantaxy025025
- 淡看人生
- ranbuijj
- gdpglc
- ssydxa219
- wallimn
- vipbooks
- hanbaohong
- jickcai
- johnsmith9th
- javashop
- appalese
- gaojingsong
- weiyides
- zhangyi0618
- AVI
- java-007
- laiyangdeli
- lyongq04
- xpenxpen
- liunancun
- 龙哥IT
- nychen2000
- conkeyn
- lyndon.lin
- panshunchang
- ouanui
最新文章列表
【最大流+dinic+二分枚举】北大 poj 3189 Steady Cow Assignment
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2012 panyanyany All rights reserved.
URL : http://poj.or ...
【最大流+dinic+二分】北大 poj 2455 Secret Milking Machine
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2012 panyanyany All rights reserved.
URL : http://poj.or ...
【最大流+floyd+二分+dinic】北大 poj 2112 Optimal Milking
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2012 panyanyany All rights reserved.
URL : http://poj.or ...
【最大流+dinic】北大 poj 1459 Power Network
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : http://po ...
【最大流+Dinic+Edmonds_Karp+二分匹配】北大 poj 1698 Alice's Chance
Dinic 算法
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : ht ...
[最大流]hdoj 3572:Task Schedule
大致题意: 有n个工件,已知第i个工件需要pi天加工,而且只能在第si天到第ei天加工这个工件。每天可以并行加工m个工件。求所有工件是否都能在规定期限内加工完成。大致思路: 应该算是最简单的网络流题目了吧,把工作和日期都抽象成节点,设源汇点。从源点向每一个工件连边,容量为完成工作所需要的天数。每个工作都向可以加工他的日期连边,容量为1。每个日期都向汇点连边,容量为每天可以加工工件数量的最 ...
【最大流+模板题】杭电 hdu 3549 Flow Problem
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : http://acm.hdu. ...
poj 1273 dinic算法求最大流
#include <stdio.h>
#include <string.h>
//#define DEBUG
#ifdef DEBUG
#define debug(...) printf( __VA_ARGS__)
#else
#define debug(...)
#endif
#define N 201
#define MAXQSIZE ...