旅行者征程

 

 我的代码：

#include<iostream>
#include <set>
using namespace std;
#define MAX 1000000

struct Node
{
	int v;
	struct Node* next=NULL;
};
struct Tree
{
	int u;
	struct Node* firstNode = NULL;
}t[MAX + 1]; //下标范围从0到1000000
int mark[MAX + 1] = { 0 };
set<int> sb;
void add(int x, int y)
{
	Node* tmp = new Node;
	if (t[x].firstNode == NULL)
	{
		tmp->v = y;
		t[x].firstNode = tmp;
	}
	else
	{
		Node* line = t[x].firstNode;
		while (line->next != NULL)line = line->next;
		tmp->v = y;
		line->next = tmp;
	}
}

class solution
{
public:
	void dfs(int head, int x,int& maxdot,int &maxi,int lenth,int mark[])
	{
		Node* tmp = t[x].firstNode;
		mark[x] = 1;
		if (head != x)lenth++;//刚访问时不用加长度
		while (tmp != NULL)
		{
			if (mark[tmp->v] == 0)
			{
				dfs(head, tmp->v, maxdot, maxi, lenth, mark);
			}
			tmp = tmp->next;
		}
		if (lenth > maxi)
		{
			sb.clear();
			maxi = lenth;
			maxdot = x;
			sb.insert(x);
		}
		else if (lenth == maxi)
		{
			maxdot = x;
			sb.insert(x);
		}
		return;
	}
};

void Dot(int n,int head, int x,int &maxdot,int &maxi)
{
	solution s;
	for (int i = 0; i < n+1; i++)mark[i] = 0;
	s.dfs(head, x, maxdot, maxi, 0, mark);
}

int main()
{
	int n;
	cin >> n;
	int x, y;
	for (int i = 0; i < n - 1; i++)
	{
		cin >> x >> y;
		add(x, y);
		add(y, x);
	}

	set<int>rec;
	int p1, p2, m1, m2;
	p1 = -1;
	m1 = -1;
	p2 = -1;
	m2 = -1;
	Dot(n,1, 1,p1,m1);
	for (auto it = sb.begin(); it != sb.end(); it++)rec.insert(*it);
	Dot(n,p1, p1, p2, m2);
	for (auto it = sb.begin(); it != sb.end(); it++)rec.insert(*it);

	for (auto it = rec.begin(); it != rec.end(); it++)cout << *it << ' ';
	

	return 0;
}

通过两次dfs找出直径并记录下可以走出直径的点，但这样超时了，应该用动态规划，还没研究出来呵