地址:http://acm.hdu.edu.cn/showproblem.php?pid=1856
题意:找一组的最大人数。
mark:并查集,注意最后搜索的细节。虽然wa了很多次,但是ac了还是很爽的。
代码:
#include <stdio.h> #include <string.h> #include <stdlib.h> int a[200010], b[200010], c[200010][2], d[100010]; int j; int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; } int ef(int a) { int fr = 0, la = j-1, mi; while(fr <= la) { mi = (fr+la)/2; if(b[mi] == a) return mi; if(b[mi] < a) fr = mi+1; else la = mi-1; } } int find(int a) { if(c[a][0] == a) return a; return c[a][0] = find(c[a][0]); } void merge(int a, int b) { int p = find(a), q = find(b); if(p != q) c[p][0] = q; } int main() { int n,x,y,sum,max; int i; while(~scanf("%d", &n)) { for(i = 0; i < 2*n; i++) { scanf("%d", a+i); b[i] = a[i]; } qsort(b, 2*n, 4, cmp); for(i = j = 1; i < 2*n; i++) if(b[i] != b[i-1]) b[j++] = b[i]; for(i = 0; i < 2*n; i++) { c[i][0] = i; c[i][1] = 1; } for(i = 0; i < 2*n; i += 2) { x = ef(a[i]); y = ef(a[i+1]); merge(x, y); } memset(d, 0, sizeof(d)); for(i = 0; i < j; i++) { if(c[i][1]) { x = i; sum = 0; while(c[x][0] != x) { if(c[x][1]) {sum++; c[x][1] = 0;} //特别注意这个小标记!!!wa了很多次 x = c[x][0]; } d[x] += sum; } } for(i = max = 0; i < j; i++) if(d[i] > max) max = d[i]; printf("%d\n", max+1); } }