线段树初探

线段树是一种用于维护区间性质的数据结构，支持在线处理，其本身是一颗完全二叉树。

HDOJ 1166 单点修改区间查询维护区间和
题目传送门：http://acm.hdu.edu.cn/showproblem.php?pid=1166
模版题，树状数组亦可A

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int MAX = 50005;
struct Tree {
    int begin;
    int end;
    int sum;
};
Tree tree[MAX * 4]; 

void update(int parent)
{
    if (tree[parent].begin == tree[parent].end) return;
    tree[parent].sum = tree[parent * 2].sum + tree[parent * 2 + 1].sum;
    return ;
}

void createTree(int parent, int begin, int end)
{
    tree[parent].begin = begin;
    tree[parent].end = end;
    if (begin == end) {
        scanf("%d",&tree[parent].sum);
        return;
    }
    int mid = (begin + end) / 2;
    createTree(2 * parent, begin, mid);
    createTree(2 * parent + 1, mid + 1, end);
    update(parent);
    return ;
}

void modify(int x, int pos, int v)
{
    if (tree[x].begin == tree[x].end) {
        tree[x].sum += v;
        return ;
    } 
    int mid = (tree[x].begin + tree[x].end) / 2;
    if (pos > mid) {
        modify(x * 2 + 1, pos, v);
    } else {
        modify(x * 2, pos, v);
    }
    update(x);
    return ;
}

int query(int x, int begin, int end)
{
    if (begin <= tree[x].begin && end >= tree[x].end) {
        return tree[x].sum;
    }
    int mid = (tree[x].begin + tree[x].end) / 2;
    int ret = 0;
    if (begin <= mid) ret += query(x * 2, begin, end);
    if (end > mid) ret += query(x * 2 + 1, begin, end);
    return ret;
}

int main(int argc, char const *argv[])
{
    int n,t;
    int tc = 1;
    scanf("%d",&t);
    while (t --)
    {
        printf("Case %d:\n",tc ++);
        memset(tree,0,sizeof(tree));
        scanf("%d",&n);
        createTree(1,1,n);
        char s[15];
        while (scanf("%s",s), s[0] != 'E') {
            int a,b;
            scanf("%d%d",&a,&b);
            if (s[0] == 'Q') {
                printf("%d\n",query(1,a,b));
            }
            if (s[0] == 'A') {
                modify(1,a,b);
            }
            if (s[0] == 'S') {
                modify(1,a,-b);
            }
        }
    }
    return 0;
}

HDOJ 1754 单点修改区间查询维护最大值
题目传送门：http://acm.hdu.edu.cn/showproblem.php?pid=1754

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int MAX = 200010;
struct T{
    int begin;
    int end;
    int sum;
};
T t[MAX * 4];

inline Max(int a, int b)
{
    return a > b ? a : b;
}

inline void update(int x)
{
    if (t[x].begin == t[x].end) return;
    t[x].sum = Max(t[x * 2].sum, t[x * 2 + 1].sum);
    return ;
}

void create(int x, int begin, int end)
{
    t[x].begin = begin;
    t[x].end = end;
    if (begin == end) {
        scanf("%d",&t[x].sum);
        return ;
    }
    int mid = (begin + end) / 2;
    create(x * 2, begin, mid);
    create(x * 2 + 1, mid + 1, end);
    update(x);
}

void modify(int x, int pos, int v)
{
    if (t[x].begin == t[x].end ) {
        t[x].sum = v;
        return ;
    }
    int mid = (t[x].begin + t[x].end) / 2;
    if (pos > mid) {
        modify(x * 2 + 1, pos, v);
    } else {
        modify(x * 2, pos, v);
    }
    update(x);
}

int query(int x, int begin, int end) 
{
    if (begin <= t[x].begin && end >= t[x].end) {
        return t[x].sum;
    }
    int ret = 0;
    int mid = (t[x].begin + t[x].end) / 2;
    if (mid < end) ret = query(x * 2 + 1, begin, end);
    if (mid >= begin) ret =Max(ret,query(x * 2, begin, end));
    return ret; 
}

int main(int argc, char const *argv[])
{
    int n,m;
    while (~scanf("%d%d",&n,&m)) {
        memset(t,0,sizeof(t));
        create(1,1,n);
        while (m --) {
            char c;
            int a,b;
            scanf(" %c%d%d",&c,&a,&b);
            if (c == 'Q') {
                printf("%d\n",query(1,a,b));
            }
            if (c == 'U') {
                modify(1,a,b);
            }
        }
    }

    return 0;
}

HDOJ 1540 区间修改单点查询
题目传送门：http://acm.hdu.edu.cn/showproblem.php?pid=1540
线段树的区间修改需要打tag标记，在下次modify或是query时pushdown tag标记，以提高时间效率。
这道题除了用到tag标记之外，还需要将树映射到一个线性结构上，为了实现区间修改的目的，使用dfs序。这样树上任意的一棵树，在dfs序上这棵树的根一定先于它的子节点先出现，且这棵树在dfs序上是连续的。

#include <cstring>
#include <cstdio>
using namespace std;

const int MAX = 50005;
int cnt, head[MAX];
int vis[MAX],left[MAX],right[MAX],now;

struct Tree {
    int tag;
    int l,r;
} t[MAX * 4];
struct Node {
    int v,nt;
} edge[MAX];

void init(void)
{
    memset(left,0,sizeof(left));
    memset(right,0,sizeof(right));
    memset(vis,0,sizeof(vis));
    memset(t,0,sizeof(t));
    memset(edge,0,sizeof(edge));
    memset(head,0,sizeof(head));
    cnt = 1;
    now = 0;
}
void add(int u, int v)
{
    edge[cnt].v = v;
    edge[cnt].nt = head[u];
    head[u] = cnt;
    ++ cnt;
    return ; 
}
void pushdown(int x)
{
    if (t[x].l == t[x].r || t[x].tag == -1) return ;
    t[x*2].tag = t[x*2+1].tag = t[x].tag;
    t[x].tag = -1;
    return ;
}
void build (int x, int l, int r)
{
    t[x].tag = -1;
    t[x].l = l; t[x].r = r;
    if (l == r) {
        return ;
    }
    int mid = (l+r) >> 1;
    build(2*x, l, mid);
    build(2*x+1,mid+1,r);
    return ;
}
void modify(int x,int l, int r, int v)
{
    if (l <= t[x].l && t[x].r <= r) {
        t[x].tag = v;
        return ;
    }
    pushdown(x);
    int mid = (t[x].l + t[x].r) >> 1;
    if (l <= mid) modify(x*2,l,r,v);
    if (r > mid) modify(x*2+1,l,r,v);
}
int query(int x, int loc)
{
    if (t[x].l == t[x].r) {
        return t[x].tag;
    }
    int mid = (t[x].l + t[x].r ) >> 1;
    pushdown(x);
    if (loc <= mid) return query(x*2,loc);
    else return query(x*2+1,loc);
}
void dfs(int x)
{
    left[x] = ++ now;
    for (int i = head[x]; i; i = edge[i].nt) {
        dfs(edge[i].v);
    }
    right[x] = now;
    return ;
}
int main()
{
    int t,tc = 0;
    scanf("%d",&t);
    while (t --) {
        init();
        int n,m,u,v;
        scanf("%d",&n);
        build(1,1,n);
        for (int i = 1; i <= n - 1; i ++) {
            scanf("%d%d",&v,&u);
            add(u,v);
            vis[v] = 1;
        }
        int root;
        for (int i = 1; i <= n; i ++) {
            if (vis[i] == 0) {
                root = i;
                break;
            }
        }
        dfs(root);
        scanf("%d",&m);
        printf("Case #%d:\n",++ tc);
        char c;int x,y;
        for (int i = 1; i <= m; i ++) {
            scanf(" %c",&c);
            if (c == 'C') {
                scanf("%d",&x);
                printf("%d\n",query(1,left[x]));
            } else if (c == 'T') {
                scanf("%d%d",&x,&y);
                modify(1,left[x],right[x],y);
            }
        }
    }
    return 0;
}