2013年9月4日
POJ 3177 Redundant Paths & POJ 3352 Road Construction（双连通分量）
摘要： DescriptionIn order to get from one of the F (1 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 8 const int MAXN = 5010; 9 const int MAXE = 20010;10 11 int head[MAXN], sccno[MAXN];12 int to[MAXE], next[MAXE];13 bool vis[MAXE];14 int pre[MAXN], lowlink[MAXN];15 int stk[MAXN... 阅读全文
posted @ 2013-09-04 22:17 Oyking 阅读(318) 评论(0) 推荐(0)
POJ 1149 PIGS（最大流）
摘要： DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse because he doesn't have the keys. Customers come to the farm one after another. Each of them has keys to some pig-houses and wants to buy a certain number of pigs. All data concernin 阅读全文
posted @ 2013-09-04 14:18 Oyking 阅读(286) 评论(0) 推荐(0)