Oyking

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 阅读(312) 评论(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 阅读(276) 评论(0) 推荐(0) 编辑

2013年9月3日

POJ 2186 Popular Cows（强联通+缩点）

摘要： DescriptionEvery cow's dream is to become the most popular cow in the herd. In a herd of N (1 2 #include 3 #include 4 #include 5 using namespace std; 6 7 const int MAXN = 10010; 8 const int MAXE = 50010; 9 10 int outdeg[MAXN], pre[MAXN], lowlink[MAXN], sum[MAXN];11 int head[MAXN], sccno[MAXN], . 阅读全文

posted @ 2013-09-03 19:43 Oyking 阅读(227) 评论(0) 推荐(0) 编辑

2013年9月2日

POJ 1463 Strategic game（二分图最大匹配）

摘要： DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must defend a medieval city, the roads of which form a tree. He has to put the minimum number of soldiers on t 阅读全文

posted @ 2013-09-02 23:53 Oyking 阅读(238) 评论(0) 推荐(0) 编辑

POJ 2761 Feed the dogs（平衡树or划分树or主席树）

摘要： DescriptionWind loves pretty dogs very much, and she has n pet dogs. So Jiajia has to feed the dogs every day for Wind. Jiajia loves Wind, but not the dogs, so Jiajia use a special way to feed the dogs. At lunchtime, the dogs will stand on one line, numbered from 1 to n, the leftmost one is 1, the s 阅读全文

posted @ 2013-09-02 23:21 Oyking 阅读(414) 评论(0) 推荐(0) 编辑

POJ 2528 Mayor's posters（线段树）

摘要： DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has finally decided to build an electoral wall for placing the posters and introduce the following rul 阅读全文

posted @ 2013-09-02 21:03 Oyking 阅读(210) 评论(0) 推荐(0) 编辑

POJ 2182 / HDU 2711 Lost Cows（平衡树）

摘要： DescriptionN (2 2 #include 3 #include 4 #include 5 using namespace std; 6 7 const int MAXN = 8010; 8 9 int key[MAXN], weight[MAXN], child[MAXN][... 阅读全文

posted @ 2013-09-02 19:53 Oyking 阅读(321) 评论(0) 推荐(0) 编辑

POJ 1703 Find them, Catch them（并查集拓展）

摘要： DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which gang a criminal belongs to. The present question is, given two criminals; do they belong t 阅读全文

posted @ 2013-09-02 12:02 Oyking 阅读(243) 评论(0) 推荐(0) 编辑

POJ 2082 Terrible Sets（栈）

摘要： DescriptionLet N be the set of all natural numbers {0 , 1 , 2 , . . . }, and R be the set of all real numbers. wi, hi for i = 1 . . . n are some elements in N, and w0 = 0. Define set B = { | x, y ∈ R and there exists an index i > 0 such that 0 | x, y ∈ R and x0 2 #include 3 #include 4 #include .. 阅读全文

posted @ 2013-09-02 11:17 Oyking 阅读(201) 评论(0) 推荐(0) 编辑

2013年9月1日

POJ 2161 Chandelier（动态规划）

摘要： DescriptionLamps-O-Matic company assembles very large chandeliers. A chandelier consists of multiple levels. On the first level crystal pendants are a... 阅读全文

posted @ 2013-09-01 16:28 Oyking 阅读(461) 评论(0) 推荐(0) 编辑

公告