转载请注明出处__谢谢!
http://blog.csdn.net/huiyuan_ai?viewmode=contents by---huiyuan_ai求认识大神(ˇ^ˇ),目前只会水题- -#~~~!
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define INF 0x7fffffff
#define maxn 10005
#define maxm 500005
int n,m;
struct Edge{
int from,to,dist;
bool operator<(const Edge& cmp)const{
return dist<cmp.dist;
}
}e[500005];
int g[maxn],f[maxn],p[maxm],ans[maxm];
void init(){
for(int i=0;i<=n;i++){f[i]=i;g[i]=1;}
}
int find(int x){
if(x!=f[x])f[x]=find(f[x]);
return f[x];
}
int main(){
while(~scanf("%d%d",&n,&m)){
init();
for(int i=1;i<=m;i++){
int a,b,v;
scanf("%d%d%d",&a,&b,&v);
e[i].from=a;e[i].to=b;e[i].dist=v;
}
sort(e+1,e+m+1);
ans[0]=0;p[m]=INF;
for(int i=1;i<=m;i++){
p[i-1]=e[i].dist;
int x=find(e[i].from);
int y=find(e[i].to);
if(x==y)ans[i]=ans[i-1];
else{
ans[i]=ans[i-1]+(g[x]+g[y])*(g[x]+g[y]-1)-g[x]*(g[x]-1)-g[y]*(g[y]-1);
g[x]+=g[y];
f[y]=x;
}
}
for(int i=0;i<=m;i++)ans[i]=n*(n-1)-ans[i];
int tol,t,k;
scanf("%d",&tol);
while(tol--){
scanf("%d",&t);
k=lower_bound(p,p+m,t)-p;
printf("%d\n",ans[k]);
}
}
return 0;
}