lightoj 1123（增量最小生成树）

传送门

每次跑最小生成树，如果生成环就把当前边（无效边）去掉。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=204,MAXM=6004;
int n,m;
int fa[MAXN];
struct EDGE {
	int u,v,w;
	bool operator <(const EDGE &a) const {
		return w<a.w;
	}
}e[MAXM];int cnt=0;
inline int read() {
	int x=0;char c=getchar();
	while (c<'0'||c>'9') c=getchar();
	while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
	return x;
}
int find(int x) {
	return fa[x]==x?x:fa[x]=find(fa[x]);
}
inline int work() {
	for (register int i=1;i<=n;++i) fa[i]=i;
	int ret=0,blo=n,done=-1;
	for (register int i=1;i<=cnt;++i) {
		int u=find(e[i].u),v=find(e[i].v);
		if (u^v) {
			ret+=e[i].w;
			--blo;
			fa[u]=v;
		}
		else done=i;
	}
	if (~done) e[done]=e[cnt--];
	return blo==1?ret:-1;
}
int main() {
//	freopen("lightoj 1123.in","r",stdin);
	int kase=read();
	for (int t=1;t<=kase;++t) {
		cnt=0;
		printf("Case %d:\n",t);
		n=read(),m=read();
		for (register int i=0;i<m;++i) {
			++cnt;
			e[cnt].u=read(),e[cnt].v=read(),e[cnt].w=read();
			sort(e+1,e+cnt+1);
			printf("%d\n",work());
		}
	}
	return 0;
}