线段数:
http://dongxicheng.org/structure/segment-tree/
http://hi.baidu.com/semluhiigubbqvq/item/be736a33a8864789f4e4ad18
http://www.notonlysuccess.com/index.php/segment-tree-complete/ 经典
单点更新:
hdu1166
#include<stdio.h>
#define MAXN 50000
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
int sum[MAXN<<2];
//maxn的取值 2^0+2^1+...+2^k(x^k>=n)=2^(k+1)-1>=maxn;
bool cmp(int x,int y)
{
return x<y;
}
//向上
void PushUp(int rt)
{
sum[rt]=sum[......
阅读全文