poj 3237 Tree 树链剖分

Tree

Time Limit: 5000MS		Memory Limit: 131072K
Total Submissions: 6481		Accepted: 1775

Description

You are given a tree with N nodes. The tree’s nodes are numbered 1 through N and its edges are numbered 1 through N − 1. Each edge is associated with a weight. Then you are to execute a series of instructions on the tree. The instructions can be one of the following forms:

CHANGE i v	Change the weight of the ith edge to v
NEGATE a b	Negate the weight of every edge on the path from a to b
QUERY a b	Find the maximum weight of edges on the path from a to b

Input

The input contains multiple test cases. The first line of input contains an integer t (t ≤ 20), the number of test cases. Then follow the test cases.

Each test case is preceded by an empty line. The first nonempty line of its contains N (N ≤ 10,000). The next N − 1 lines each contains three integers a, b and c, describing an edge connecting nodes a and bwith weight c. The edges are numbered in the order they appear in the input. Below them are the instructions, each sticking to the specification above. A lines with the word “DONE” ends the test case.

Output

For each “QUERY” instruction, output the result on a separate line.

Sample Input

1

3
1 2 1
2 3 2
QUERY 1 2
CHANGE 1 3
QUERY 1 2
DONE

Sample Output

1
3

Source

POJ Monthly--2007.06.03, Lei, Tao

依旧是赛前突击系列...

题目链接：http://poj.org/problem?id=3237

题目大意：给一棵树，三种操作。将第i条边的权值改为v，将a到b的路径上的边的权值全部取反，求a到b路径上边的权值的最大值。

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
using namespace std;
typedef long long LL;
#define pll pair<LL, LL>
#define pii pair<int, int>
#define X first
#define Y second
#define MAXN 10010//点数
#define MAXM 20010//边数
#define lson l, mid, (rt << 1)
#define rson mid + 1, r, (rt << 1 | 1)
const double eps = 1e-10;
const int inf = INT_MIN;
int t, n;
struct node {
    int next, to;
} edge[MAXM];
int head[MAXN];
int fa[MAXN], dep[MAXN], siz[MAXN], top[MAXN], son[MAXN];
int Rank[MAXN], tid[MAXN], tim, tot;
//tid[v]表示v与其父亲节点的连边在线段树中的位置，Rank和p数组相反
int e[MAXN][3];
void init() {
    memset(head, -1, sizeof head);
    memset(son, -1, sizeof son);
    tim = 0;
    tot = 0;
}
void addedge(int u, int v) {
    edge[tot].to = v;
    edge[tot].next = head[u];
    head[u] = tot++;
}
void dfs1(int u, int pre) {
    siz[u] = 1;
    dep[u] = dep[pre] + 1;
    fa[u] = pre;
    for(int i = head[u]; i != -1; i = edge[i].next) {
        int v = edge[i].to;
        if(v == pre) continue;
        dfs1(v, u);
        siz[u] += siz[v];
        if(son[u] == -1 || siz[son[u]] < siz[v]) {
            son[u] = v;
        }
    }
}
void dfs2(int u, int tp) {
    top[u] = tp;
    tid[u] = ++tim;
    Rank[tid[u]] = u;
    if(son[u] == -1) return ;
    dfs2(son[u], tp);
    for(int i = head[u]; i != -1; i = edge[i].next) {
        int v = edge[i].to;
        if(v != son[u] && v != fa[u])
            dfs2(v, v);
    }
}
//----------------------------------------------------
struct SegmentTree {
    int Max, Min;
} tree[MAXN << 2];
int col[MAXN << 2];
void pushup(int rt) {
    tree[rt].Max = max(tree[rt << 1].Max, tree[rt << 1 | 1].Max);
    tree[rt].Min = min(tree[rt << 1].Min, tree[rt << 1 | 1].Min);
}
void pushdown(int rt) {
    if(col[rt]) {
        col[rt << 1] ^= 1;
        col[rt << 1 | 1] ^= 1;
        tree[rt << 1].Max = -tree[rt << 1].Max;
        tree[rt << 1].Min = -tree[rt << 1].Min;
        swap(tree[rt << 1].Max, tree[rt << 1].Min);
        tree[rt << 1 | 1].Max = -tree[rt << 1 | 1].Max;
        tree[rt << 1 | 1].Min = -tree[rt << 1 | 1].Min;
        swap(tree[rt << 1 | 1].Max, tree[rt << 1 | 1].Min);
        col[rt] = 0;
    }
}
void build(int l, int r, int rt) {
    col[rt] = 0;
    tree[rt].Max = tree[rt].Min = 0;
    if(l == r) {
        return;
    }
    int mid = (l + r) / 2;
    build(lson);
    build(rson);
}
void update1(int pos, int l, int r, int rt, int x) {
    if(l == r) {
        tree[rt].Max = tree[rt].Min = x;
        col[rt] = 0;
        return ;
    }
    pushdown(rt);
    int mid = (l + r) >> 1;
    if(pos <= mid) update1(pos, lson, x);
    else update1(pos, rson, x);
    pushup(rt);
}
void update2(int st, int ed, int l, int r, int rt) {
    if(st <= l && r <= ed) {
        tree[rt].Max = -tree[rt].Max;
        tree[rt].Min = -tree[rt].Min;
        swap(tree[rt].Max, tree[rt].Min);
        col[rt] ^= 1;
        return ;
    }
    pushdown(rt);
    int mid = (l + r) >> 1;
    if(st <= mid) update2(st, ed, lson);
    if(ed > mid) update2(st, ed, rson);
    pushup(rt);
}
int query(int st, int ed, int l, int r, int rt) {
    if(st <= l && r <= ed) {
        return tree[rt].Max;
    }
    pushdown(rt);
    int mid = (l + r) >> 1;
    if(ed <= mid) return query(st, ed, lson);
    else if(st > mid) return query(st, ed, rson);
    else return max(query(st, mid, lson), query(mid + 1, ed, rson));
    pushup(rt);
}
int getmax(int x, int y) {
    int res = inf;
    while(top[x] != top[y]) {
        if(dep[top[x]] < dep[top[y]]) swap(x, y);
        res = max(res, query(tid[top[x]], tid[x], 1, tim, 1));
        x = fa[top[x]];
    }
    if(x == y) return res;
    if(dep[x] > dep[y]) swap(x, y);
    res = max(res, query(tid[son[x]], tid[y], 1, tim, 1));
    return res;
}
void Negate(int x, int y) {
    while(top[x] != top[y]) {
        if(dep[top[x]] < dep[top[y]]) swap(x, y);
        update2(tid[top[x]], tid[x], 1, tim, 1);
        x = fa[top[x]];
    }
    if(x == y) return ;
    if(dep[x] > dep[y]) swap(x, y);
    update2(tid[son[x]], tid[y], 1, tim, 1);
}
int main() {
    scanf("%d", &t);
    while(t--) {
        scanf("%d", &n);
        init();
        for(int i = 0; i < n - 1; i++) {
            scanf("%d%d%d", &e[i][0], &e[i][1], &e[i][2]);
            addedge(e[i][0], e[i][1]);
            addedge(e[i][1], e[i][0]);
        }
        dfs1(1, 0);
        dfs2(1, 1);
        build(1, tim, 1);
        for(int i = 0; i < n - 1; i++) {
            if(dep[e[i][0]] > dep[e[i][1]])
                swap(e[i][0], e[i][1]);
            update1(tid[e[i][1]] ,1, tim, 1, e[i][2]);
        }
        char ch[10];
        int a, b;
        while(true) {
            scanf("%s", ch);
            if(ch[0] == 'D') break;
            scanf("%d%d", &a, &b);
            if(ch[0] == 'Q') {
                printf("%d\n", getmax(a, b));
            } else if(ch[0] == 'C') {
                update1(tid[e[a - 1][1]], 1, tim, 1, b);
            } else {
                Negate(a, b);
            }
        }
    }
    return 0;
}