树链剖分
二_叉
这个作者很懒,什么都没留下…
展开
-
poj3237 Tree
#include #include #include using namespace std; const int Max=10086,Inf=(1<<30); inline int MIN(int a,int b) { return a<b?a:b; } inline int MAX(int a,int b) { return a>b?a:b; } int val[Max]; st原创 2014-10-14 22:08:54 · 427 阅读 · 0 评论 -
FOJ2082 过路费
#pragma comment(linker, "/STACK:1024000000,1024000000") #include #include using namespace std; const int Max=50005; __int64 val[Max]; struct SegmentTree { __int64 sum[Max int L,原创 2014-10-14 21:58:27 · 380 阅读 · 0 评论 -
hdu3966 Aragorn's Story
#pragma comment(linker,"/STACK:1024000000,1024000000") #include #include #include using namespace std; const int Max=50005; int val[Max]; struct SegmentTree { int cnt[Max<<2],flag[Max<<2];原创 2014-10-14 22:01:53 · 437 阅读 · 0 评论 -
hybz1036 树的统计Count
#include#include#includeusing namespace std;const int Max=30009;inline int MAX(int a,int b){return a>b?a:b;}int val[Max];struct SemgentTree{int sum[Max<<2],maxv[Max<<2];inline void PushUp(int idx){max原创 2014-10-14 22:06:09 · 354 阅读 · 0 评论 -
hybz2243 染色
#include#include#includeusing namespace std;const int Max=100860;int val[Max];struct SegmentTree{int lc[Max<<2],rc[Max<<2],cnt[Max<<2],flag[Max<<2];inline void PushUp(int idx){int L=idx<<1 r="L+1;" lc原创 2014-10-16 17:24:31 · 554 阅读 · 0 评论