
费用流
xiaoyu1_1
学生
展开
-
hdu-4322-Candy-费用流
http://blog.youkuaiyun.com/julyana_lin/article/details/8095405 #include #include #include #include #include using namespace std; const int N = 1010;//点 const int M = 2 * 10010;//边 const int inf = 1000原创 2014-02-15 10:29:35 · 530 阅读 · 0 评论 -
hdu-4411-Arrest-费用流
http://www.cnblogs.com/jianglangcaijin/archive/2012/09/24/2700509.html #include #include #include #include #include using namespace std; const int N = 1010;//点 const int M = 4 * 10010;//边 const int原创 2014-02-15 16:09:01 · 483 阅读 · 0 评论 -
hdu-4780-Candy Factory--费用流
#include #include #include #include #include using namespace std; const int N = 510;//点 const int M = 161000;//边 const int inf = 1000000000; struct Node{//边,点f到点t,流量为c,费用为w int f, t, c, w; }e[M]; in原创 2014-02-15 23:05:00 · 651 阅读 · 0 评论