2012年8月23日
【POJ】2763 Housewife Wind
摘要： 1 #include<cstdio> 2 #include<cstring> 3 #include<queue> 4 #include<iostream> 5 #define MAXN 100010 6 #define MAXM 200010 7 using namespace std; 8 struct LCT { 9 int bef[MAXN], belong[MAXN]; 10 int next[MAXN][2], pre[MAXN], key[MAXN], sum[MAXN]; 11 void Init() { 12 mems... 阅读全文
posted @ 2012-08-23 22:40 DrunBee 阅读(539) 评论(0) 推荐(0)
【HDU】3966 Aragorn's Story
摘要： 1 #include<cstdio> 2 #include<cstring> 3 #include<queue> 4 #include<iostream> 5 #define MAXN 50010 6 #define MAXM 100010 7 using namespace std; 8 struct LCT { 9 int bef[MAXN]; 10 int next[MAXN][2], pre[MAXN], key[MAXN], add[MAXN]; 11 void Init() { 12 memset(next, 0, siz... 阅读全文
posted @ 2012-08-23 22:07 DrunBee 阅读(493) 评论(0) 推荐(0)
【POJ】3237 Tree
摘要： 1 #include<cstdio> 2 #include<cstring> 3 #include<queue> 4 #include<iostream> 5 #include<algorithm> 6 #define MAXN 100010 7 #define MAXM 200010 8 #define oo 0x7FFFFFFF 9 using namespace std; 10 bool vis[MAXN]; 11 int first[MAXN], next[MAXM], v[MAXM], cost[MAXM], e; 12 s 阅读全文
posted @ 2012-08-23 21:40 DrunBee 阅读(716) 评论(0) 推荐(0)
【CodeForces】191C Fools and Roads
摘要： 1 #include<cstdio> 2 #include<cstring> 3 #include<iostream> 4 #include<queue> 5 #define MAXN 100010 6 #define MAXM 200010 7 using namespace std; 8 int first[MAXN], next[MAXM], v[MAXM], e; 9 bool vis[MAXN]; 10 struct LCT { 11 int bef[MAXN], belong[MAXN]; 12 int next[MAXN][2], 阅读全文
posted @ 2012-08-23 11:17 DrunBee 阅读(636) 评论(0) 推荐(0)
【URAL】1553 Caves and Tunnels
摘要： 1 #include<cstdio> 2 #include<cstring> 3 #include<queue> 4 #include<iostream> 5 #include<algorithm> 6 #define MAXN 100010 7 #define MAXM 200010 8 using namespace std; 9 bool vis[MAXN]; 10 int first[MAXN], second[MAXM], v[MAXM], e; 11 struct LCT { 12 int bef[MAXN]; 13 in 阅读全文
posted @ 2012-08-23 02:39 DrunBee 阅读(419) 评论(0) 推荐(0)
【HYSBZ】1036 树的统计Count
摘要： 1 #include<cstdio> 2 #include<cstring> 3 #include<queue> 4 #include<iostream> 5 #include<algorithm> 6 #define oo 0x7FFFFFFF 7 #define MAXN 30010 8 #define MAXM 60010 9 using namespace std; 10 int first[MAXN], next[MAXM], v[MAXM], e; 11 bool vis[MAXN]; 12 struct LCT { 13 阅读全文
posted @ 2012-08-23 01:28 DrunBee 阅读(411) 评论(0) 推荐(0)