总结:
1.关于图的题可能会超时,优先选printf和scanf,优先选邻接表存储
代码:
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int repair = 0;
vector<vector<int> >pp;
int visitied[1000];
int n, m, k;
void dfs(int index,int x,int vi[])
{
if (vi[index] == 1)return;
else if (index == x)return;
else{
vi[index] = 1;
for (int k = 0; k < pp[index].size(); k++)
if(pp[index][k]!=x)dfs(pp[index][k],x,vi);
}
}
int main()
{
cin >> n >> m >> k;
pp.resize(n+1);
for (int i = 0; i < m; i++)
{
int a, b;
scanf("%d%d",&a,&b);
pp[a].push_back(b);
pp[b].push_back(a);
}
for (int i = 0; i < k; i++)
{
int x;
scanf("%d",&x);
int vi[1000];
fill(vi,vi+1000,0);
for (int j = 1; j <= n; j++) //求有几个最大连通子图
{
if (j == x)continue;
if (vi[j] == 0){ dfs(j,x,vi); repair++; }
}
printf("%d",repair-1);
if (i != k - 1)printf("\n");
repair = 0;
}
return 0;
}