摘要:
HDU 2282 Chocolate (最小费用最大流)#include #include #include #include using namespace std;const int maxn=30000;const int inf=200000000;struct edge{ int u,v,... 阅读全文
摘要:
POJ 2426 Interesting Housing Problem (最大费用最大流)#include #include #include #include using namespace std;const int maxn=30000;const int inf=200000000;str... 阅读全文
摘要:
POJ 3422 Kaka's Matrix Travels (最大费用最大流)#include #include #include #include using namespace std;const int maxn=20000;const int inf=20000000;struct edg... 阅读全文