学习了并查集
可以做做这两道并查集的题 —— P1551 亲戚 , P1536 村村通
import java.util.Scanner;
public class Main {
static int maxn = 1000005;
static int[] root = new int[maxn];
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
for(int i = 0;i < maxn;i++){
root[i] = i;
}
int[] ans = new int[N];
int cnt = 0;
for(int i = 0;i<N;i++){
int t = sc.nextInt();
t = find(t);
System.out.print(t + " ");
root[t] = t+1;
}
}
public static int find(int x){
if(root[x] != x){
root[x] = find(root[x]);
}
return root[x];
}
}