网络流
关注
分享
扫一扫
x920405451x
这个作者很懒，什么都没留下…
展开
-
poj 1149 pigs
PIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15748 Accepted: 7035DescriptionMirko works on a pig farm that consists of M locked pig-houses and原创 2014-07-20 18:54:59 · 666 阅读 · 0 评论 -
hdu 4862 最小k路径覆盖 费用流
#include #include #include #include #include #include #include #include using namespace std;#define N 220#define M 12345#define inf (1//注意 点标必须是 [0 - 汇点]//双向边，注意REstruct Ed转载 2014-07-23 19:16:55 · 683 阅读 · 0 评论 -
acdream 1171 Matrix sum
H - Matrix sumTime Limit: 8000/4000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)SubmitStatusProblem Descriptionsweet和zero在玩矩阵游戏，sweet画了一个N * M的矩阵，矩阵的每个格子有一个整数。zero给出N个数Ki原创 2014-08-02 18:26:08 · 586 阅读 · 0 评论 -
poj 2135 Farm Tour + 费用流vector模板
Farm TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11260 Accepted: 4174DescriptionWhen FJ's friends visit him on the farm, he likes to show th原创 2014-08-04 21:33:21 · 631 阅读 · 0 评论 -
hdu 4888 Redraw Beautiful Drawings
Redraw Beautiful DrawingsTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1213 Accepted Submission(s): 243Problem DescriptionA原创 2014-07-30 16:21:54 · 560 阅读 · 0 评论 -
hdu 3549 网络流模板（dinic + ISAP）
就是用来检测模板的dinic：原创 2014-10-03 00:43:53 · 784 阅读 · 0 评论