费用流
阿龙的圈子
仰望星空 脚踏实地
向前走 永不停
展开
-
poj 2135 费用流
#include #include #include #include #include using namespace std; #define MOD 0x3f3f3f3f #define V 1000 + 10 #define E 10000 + 10 int n, m; bool vis[V]; int cnt, dist[V], head[V], pre[V]; stru原创 2015-05-19 13:55:23 · 565 阅读 · 0 评论 -
zoj 月赛 E 费用流
The Exchange of Items Time Limit: 2 Seconds Memory Limit: 65536 KB Bob lives in an ancient village, where transactions are done by one item exchange with another. Bob is very clever and h原创 2015-08-03 16:54:02 · 519 阅读 · 0 评论