[数据结构]区间树上最远点对

树剖LCA+线段树维护区间最远点对
https://www.51nod.com/Challenge/Problem.html#problemId=1766

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 1e5 + 10, mod = 1e9 + 7;

struct edge{
    int v, c;
};
vector<edge> g[maxn];
//父亲、深度、大小、儿子、时间戳、重链顶、时间戳对应的编号、时间
int fa[maxn],dep[maxn],sz[maxn],son[maxn],top[maxn],rtlen[maxn];
pii a[maxn << 2];
int get_len(int tu, int tv)
{
    int u = tu, v = tv;
    while (top[u] != top[v]){
        if (dep[top[u]] > dep[top[v]]) u = fa[top[u]];
        else v = fa[top[v]];
    }
    int fa = dep[u] < dep[v] ? u : v;
    return rtlen[tu] + rtlen[tv] - 2 * rtlen[fa];
}
pii king(int la, int ra, int lb, int rb)
{
    if (la == 0 && ra == 0) return pii(lb, rb);
    if (lb == 0 && rb == 0) return pii(la, ra);
    int maxu = la, maxv = ra;
    if (get_len(la, lb) > get_len(maxu, maxv))
        maxu = la, maxv = lb;
    if (get_len(la, rb) > get_len(maxu, maxv))
        maxu = la, maxv = rb;
    if (get_len(ra, lb) > get_len(maxu, maxv))
        maxu = ra, maxv = lb;
    if (get_len(ra, rb) > get_len(maxu, maxv))
        maxu = ra, maxv = rb;
    if (get_len(lb, rb) > get_len(maxu, maxv))
        maxu = lb, maxv = rb;
    return pii(maxu, maxv);
}
pii sep_king(int la, int ra, int lb, int rb)
{
    if (la == 0 && ra == 0) return pii(1, 1);
    if (lb == 0 && rb == 0) return pii(1, 1);
    int maxu = la, maxv = lb;
    if (get_len(la, rb) > get_len(maxu, maxv))
        maxu = la, maxv = rb;
    if (get_len(ra, lb) > get_len(maxu, maxv))
        maxu = ra, maxv = lb;
    if (get_len(ra, rb) > get_len(maxu, maxv))
        maxu = ra, maxv = rb;
    return pii(maxu, maxv);
}
void pushup(int k)
{
    a[k] = king(a[k << 1].first, a[k << 1].second, a[k << 1 | 1].first, a[k << 1 | 1].second);
}
void build(int k, int l, int r)
{
    if (l == r){
        a[k].first = a[k].second = l;
        return ;
    }
    int m = (l + r) >> 1;
    build(k << 1, l, m);
    build(k << 1 | 1, m + 1, r);
    pushup(k);
}
pii query(int k, int l, int r, int x, int y)
{
    if (x <= l && r <= y) return a[k];
    int m = (l + r) >> 1;
    pii lres, rres;
    if (x <= m) lres = query(k << 1, l, m, x, y);
    if (m < y) rres = query(k << 1 | 1, m + 1, r, x, y);
    return king(lres.first, lres.second, rres.first, rres.second);
}
void dfs(int u, int p, int len)
{
    rtlen[u] = len;
    for (edge e : g[u]){
        if (e.v != p) dfs(e.v, u, len + e.c);
    }
    return ;
}
void dfs1(int u, int p, int d)
{
    fa[u] = p; dep[u] = d; sz[u] = 1;
    int maxson = 0;
    for(edge e : g[u]){
        if (e.v != p){
            dfs1(e.v, u, d + 1);
            sz[u] += sz[e.v];
            if(sz[e.v] > maxson){
                maxson = sz[e.v];
                son[u] = e.v;
            }
        }
    }
}
void dfs2(int u,int topf)
{
    top[u] = topf;
    if (son[u]){
        dfs2(son[u], topf);
        for(edge e : g[u]){
            if(e.v != fa[u] && e.v != son[u]) dfs2(e.v, e.v);
        }
    }
}

int main()
{
    int n, m, u, v, c;
    scanf("%d", &n);
    int t = n;
    while (--t){
        scanf("%d %d %d", &u, &v, &c);
        g[u].push_back(edge{v, c});
        g[v].push_back(edge{u, c});
    }
    dfs(1, 0, 0);
    dfs1(1, 0, 1);
    dfs2(1, 1);
    build(1, 1, n);
    scanf("%d", &m);
    int la, ra, lb, rb;
    while (m--){
        scanf("%d %d %d %d", &la, &ra, &lb, &rb);
        pii lans = query(1, 1, n, la, ra), rans = query(1, 1, n, lb, rb);
        pii ans = sep_king(lans.first, lans.second, rans.first, rans.second);
        printf("%d\n", get_len(ans.first, ans.second));
    }
    return 0;
}