1021 Deepest Root (25 分)
问题在于,第一次遍历的时候选取一个最远的顶点作为第二次遍历的起点,第二次遍历就能得到全部最远的点,再将此点放进去就可以,但是实测有问题?将第一次遍历的结果和第二次遍历的结果做一个合并的set就正确了,原因待查明,标记一下。
#include<iostream>
#include<sstream>
#include<vector>
#include<algorithm>
#include<set>
//using namespace std;
std::vector<std::vector<int>> x;
std::vector<int> z,y;
std::set<int> out;
int max = -1;
void dfs(int input, int count = 1)
{
z[input] = 1;
if (count > max)
{
max = count;
y.clear();
y.push_back(input);
}
else if (count == max)
y.push_back(input);
for (int i = 0; i < x[input].size(); ++i)
{
if(z[x[input][i]] != 1)
dfs(x[input][i], count + 1);
}
}
int main()
{
int countsize = 0, f, s, mid, numofcomponent = 1;
std::cin >> countsize;
x.resize((countsize + 1));
z.resize((countsize + 1), 0);
z[0] = 1;
for (int i = 0 ;i < countsize - 1; ++i)
{
std::cin >> f >> s;
x[f].push_back(s);
x[s].push_back(f);
}
f = 1;
dfs(f);
for (int i = 1; i < z.size(); ++i)
{
if (z[i] == 0)
{
max = 0;
++numofcomponent;
dfs(i);
}
}
if (numofcomponent != 1)
{
std::cout << "Error: " << numofcomponent << " components";
return 0;
}
mid = y[0];
for (auto i : y)
out.insert(i);
y.clear();
for (int i = 0; i < z.size(); ++i)
z[i] = 0;
dfs(mid);
y.push_back(mid);
for (auto i : y)
out.insert(i);
for (auto i : out)
{
std::cout << i << "\n";
}
return 0;
}