* * * Hdu 1213"How ManyTables"* * *。
那并查集为:
并查集知识不懂的可以点点这个
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 24459 Accepted Submission(s): 12241
Problem Description
Today is Ignatius’ birthday. He invites a lot of friends. Now it’s dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.
One important rule for this problem is that if I tell you A knows B, and B knows C, that means A, B, C know each other, so they can stay in one table.
For example: If I tell you A knows B, B knows C, and D knows E, so A, B, C can stay in one table, and D, E have to stay in the other one. So Ignatius needs 2 tables at least.
Input
The input starts with an integer T(1<=T<=25) which indicate the number of test cases. Then T test cases follow. Each test case starts with two integers N and M(1<=N,M<=1000). N indicates the number of friends, the friends are marked from 1 to N. Then M lines follow. Each line consists of two integers A and B(A!=B), that means friend A and friend B know each other. There will be a blank line between two cases.
Output
For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.
Sample Input
2
5 3
1 2
2 3
4 5
5 1
2 5
Sample Output
2
4
这题可以用并查集解
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1050;
int s[maxn];
void init_set()
{
for(int i=1;i<=maxn;i++) //初始化函数
s[i]=i;
}
int find_set(int x) //查找函数
{
if(x!=s[x])
s[x]=find_set(s[x]);
return s[x];
}
int union_set(int x,int y) //合并函数
{
x=find_set(x);
y=find_set(y);
if(x!=y)
s[x]=s[y];
}
int main()
{
int t,n,m,x,y;
cin>>t;
while(t--)
{
cin>>n>>m;
init_set();//进行初始化
for(int i=1;i<=m;i++)
{
cin>>x>>y;
union_set(x,y);//进行合并
}
int ans=0;
for(int i=1;i<=n;i++)
{
if(s[i]==i)
ans++;//统计有多少个集
}
cout<<ans<<endl;
}
return 0;
}