Codeforces Round #582 (Div. 3) G. Path Queries

题目链接：http://codeforces.com/contest/1213/problem/G
题意：给你一个n个节点的树 点与点之间的边有权值 m此查询
求有多少点对的简单路径上的边的最大值小等于q
思路：对查询进行排序，使用并查集进行加边保证，目前所有集合里面的边都满足要求，对于任何两个不同的集合 其本身的点对必然满足要求，合并集合后 内部点对发生改变点对数目增加 变为(a+b*（a+b+1）/2 -a* (a+1) /2 + b*(b+1)/2
AC代码：

#include <bits/stdc++.h>
using namespace std;
#define R register
#define ll long long
const int MaxN = 2e5 + 10;
struct edge
{
    int u, v, w;
    bool operator<(const edge x) const { return w < x.w; }
} e[MaxN << 1];
struct query
{
    int q, id;
    bool operator<(const query x) const { return q < x.q; }
} query[MaxN];
ll ans[MaxN], now;
int n, q, pos = 0, u, v, f[MaxN], size[MaxN];
ll getsize(ll x)
{
    return 1ll * (x - 1ll) * x / 2;
}
int getf(int x)
{
    if (f[x] != x)
        f[x] = getf(f[x]);
    return f[x];
}
int main()
{
    scanf("%d%d", &n, &q);
    for (int i = 1; i <= n; i++)
        f[i] = i, size[i] = 1;
    for (int i = 1; i < n; i++)
        scanf("%d%d%d", &e[i].u, &e[i].v, &e[i].w);
    sort(e + 1, e + n);
    for (int i = 1; i <= q; i++)
        scanf("%d", &query[i].q), query[i].id = i;
    sort(query + 1, query + 1 + q);
    for (int i = 1; i <= q; i++)
    {
        while (pos < n - 1 && e[pos + 1].w <= query[i].q)
        {
            ++pos;
            u = getf(e[pos].u), v = getf(e[pos].v);
            if (u == v)    continue;
            now = now - getsize(size[u]) - getsize(size[v]) + getsize(size[u] + size[v]);
            size[u] += size[v], f[v] = u;
        }
        ans[query[i].id] = now;
    }
    for (int i = 1; i <= q; i++)
        printf("%lld ", ans[i]);
    return 0;