PAT Advanced 1013 【Battle Over Cities】 (25)

分析：求连通块个数，注意是对所有的点进行统计，dfs遍历

#include<cstdio>
#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
const int maxn = 1010;
int vis[maxn];
vector<int> city[maxn];
void dfs(int u){
	for(int i = 0; i<city[u].size(); i++){
		int v = city[u][i];
		if(!vis[v]){
			vis[v] = 1;
			dfs(v);
		}
	}
}
int main(){
	//freopen("aa.txt", "r", stdin);
	ios::sync_with_stdio(false);
	int n, m, k, u, v;
	cin >> n >> m >> k;
	for(int i = 0; i<m; i++){
		cin >> u >> v;
		city[u].push_back(v);
		city[v].push_back(u);
	}
	for(int i = 0; i<k; i++){
		cin >> u;
		int cnt = 0;
		memset(vis, 0, sizeof vis);
		vis[u] = 1;
		for(int v = 1; v<=n; v++){
			if(!vis[v]){
				vis[v] = 1;
				cnt++;
				dfs(v);
			}
		}
		cout << cnt-1 << "\n";
	}
	return 0;
}