图论500题 ---- 并查集求路径上最大值最小不超过K的点对数 HDU Portal

题目链接

---

题目大意：

就给你一个图，$q$次询问，问你这个图上有多少对点之间的所以路径上的最大值的最小值不超过$k$?

---

解题思路：

1. 首先我们知道这本质上就是求两个点联通的路径上的最大值最小是多少？
2. 那么这个就和并查集有关系了，首先我们知道按照边的权值从小到大排序之后的依次加入图中那么如果两个点联通了那么这个边就是最小的最大值！
3. 那么我们怎么统计询问呢？就是离线查询，把询问按照从小到大排序，我们知道实际上答案就是各个联通块里面挑出两个点，因为每次只合并两个联通块，那么我们就可以动态的去维护答案，每次减去要合并的两个联通块，然后再加合并之后的块答案就可以了

时间复杂度$O(m+q)$

---

AC代码

#include <bits/stdc++.h>
#define mid ((l + r) >> 1)
#define Lson rt << 1, l , mid
#define Rson rt << 1|1, mid + 1, r
#define ms(a,al) memset(a,al,sizeof(a))
#define log2(a) log(a)/log(2)
#define lowbit(x) ((-x) & x)
#define IOS std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INF 0x3f3f3f3f
#define LLF 0x3f3f3f3f3f3f3f3f
#define f first
#define s second
#define endl '\n'
using namespace std;
const int N = 2e6 + 10, mod = 1e9 + 9;
const int maxn = 500010;
const long double eps = 1e-5;
const int EPS = 500 * 500;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
typedef pair<double,double> PDD;
template<typename T> void read(T &x)
{
   x = 0;char ch = getchar();ll f = 1;
   while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
   while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) 
{
   read(first);
   read(args...);
}
int n, m, q;
struct Edge {
   int u, v, w;
   bool operator < (const Edge & a) const {
      return w < a.w;
   } 
}edge[maxn];
int ans[maxn];
struct ask {
   int id, w;
   bool operator < (const ask & a) const {
      return w < a.w;
   }
}qu[maxn];

int fa[maxn], siz[maxn];
inline int find(int x) {
   return fa[x] == x ? x : fa[x] = find(fa[x]);
}

int main() {
    //IOS;
    while(cin >> n >> m >> q) {
      for(int i = 1; i <= n; ++ i) fa[i] = i, siz[i] = 1;
      for(int i = 1; i <= m; ++ i) {
         int u, v, w;
         cin >> u >> v >> w;
         edge[i] = {u,v,w};
      }       
      sort(edge+1,edge+1+m);
      for(int i = 1; i <= q; ++ i) {
         int w;
         cin >> w;
         qu[i] = {i,w};
      }
      sort(qu+1,qu+1+q);
      int res = 0;
      int j = 1;
      for(int i = 1; i <= m; ++ i) {
         while(j <= q && qu[j].w < edge[i].w) ans[qu[j++].id] = res;
         int fv = find(edge[i].v), fu = find(edge[i].u), w = edge[i].w;
         if(fv != fu) {
            res -= siz[fv] * (siz[fv] - 1) / 2;
            res -= siz[fu] * (siz[fu] - 1) / 2;
            fa[fv] = fu;
            siz[fu] += siz[fv];
            res += siz[fu] * (siz[fu] - 1) / 2;
         } 
      }
      while(j <= q) ans[qu[j++].id] = res;
      for(int i = 1; i <= q; ++ i)
        cout << ans[i] << "\n";
    }
    return 0;
}