Uva-1160-X-Plosives
2013-03-18 12:30
295 查看
比较简单的一道并查集练习题
代码:
代码:
#include<cstdio> #include<cstring> #include<iostream> #define MAX 100001 using namespace std; int p[MAX],ans; int find(int x) { if(p[x]==x) return x; return p[x]=find(p[x]); } int main() { int a,b; while(scanf("%d",&a)!=EOF) { for(int i=0;i<MAX;i++) p[i]=i; ans=0; while(1) { scanf("%d",&b); int ita=find(a); int itb=find(b); if(ita==itb) ans++; else p[ita]=itb; scanf("%d",&a); if(a==-1) break; } printf("%d\n",ans); } return 0; }
相关文章推荐
- Uva 1160 X-Plosives ——并查集
- uva 1160 X-Plosives (并查集)
- UVA 1160 X-Plosives
- LA 3644 - X-Plosives ( 也即UVA 1160)
- uva 1160 - X-Plosives
- UVa 1160 - X-Plosives
- uva 1160 - X-Plosives(并查集)
- UVA 1160 X-Plosives
- uva1160 X-Plosives
- UVA 1160 X-Plosives【并查集】
- UVA 1160 X-Plosives
- UVa 1160 X-Plosives(并查集)
- uva 1160 X-Plosives
- uva1160 - X-Plosives (并查集)
- uva 1160 X-Plosives(并查集:基础运用)
- UVA 1160 - X-Plosives 即LA3644 并查集判断是否存在环
- UVA-1160 - X-Plosives(并查集)
- uva 1160 - X-Plosives(并查集)
- UVA 1160 - X-Plosives
- UVA 1160——X-Plosives