最小生成树的裸题。
克鲁斯卡尔算法描述
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static int N = 200010, M = N;
static int n, m;
static int p[];
static Pair pair[];
public static void init() {
p = new int[N];
pair = new Pair[M];
for (int i = 0; i < N; i++) p[i] = i;
}
public static void main(String[] args) throws IOException {
while (true) {
String s[] = br.readLine().split(" ");
n = Integer.parseInt(s[0]);
m = Integer.parseInt(s[1]);
if (n * m == 0) break;
init();
long sum = 0;
for (int i = 0; i < m; i++) {
s = br.readLine().split(" ");
int a = Integer.parseInt(s[0]);
int b = Integer.parseInt(s[1]);
int c = Integer.parseInt(s[2]);
pair[i] = new Pair(a, b, c);
sum += c;
}
Arrays.sort(pair, 0, m);
int cnt = 0;
for (int i = 0; i < m; i++) {
int a = pair[i].a;
int b = pair[i].b;
int w = pair[i].w;
a = find(a);
b = find(b);
if (a != b) {
p[a] = b;
cnt += w;
}
}
System.out.println(sum - cnt);
}
}
public static int find(int x) {
if (p[x] != x) p[x] = find(p[x]);
return p[x];
}
}
class Pair implements Comparable<Pair> {
int a, b, w;
public Pair(int a, int b, int w) {
this.a = a;
this.b = b;
this.w = w;
}
@Override
public int compareTo(Pair pair) {
return this.w - pair.w;
}
}