首先按频率从小到大排序,然后枚举区间左端点,再枚举区间右端点,往右枚举右端点时可以用并查集维护答案。 O(n2)
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 1005
#define M 5005
#define inf 0x7fffffff
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,m,K,fa[N],size[N],k[N],ans=inf,sum;
struct data{
int x,y,f;
}a[M];
inline bool cmp(data x,data y){return x.f<y.f;}
inline int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
inline void merge(int x,int y){
int xx=find(x),yy=find(y);
if(xx==yy) return;
sum-=k[size[xx]]+k[size[yy]];
fa[yy]=xx;size[xx]+=size[yy];
sum+=k[size[xx]];
}
int main(){
// freopen("a.in","r",stdin);
n=read();m=read();K=read();
for(int i=1;i<=n;++i) k[i]=read();
for(int i=1;i<=m;++i) a[i].x=read(),a[i].y=read(),a[i].f=read();
std::sort(a+1,a+m+1,cmp);
for(int i=1;i<=m;++i){//枚举左端点的频率
if(a[i].f==a[i-1].f) continue;
for(int ii=1;ii<=n;++ii) fa[ii]=ii,size[ii]=1;sum=n*k[1];
for(int j=i;j<=m;++j){//枚举右端点的频率
if(a[j].f-a[i].f>=ans) break;
merge(a[j].x,a[j].y);
if(sum>=K){ans=a[j].f-a[i].f;break;}
}
}
if(ans!=inf) printf("%d\n",ans);
else puts("T_T");
return 0;
}