{"trustable":false,"sections":[{"title":"题目描述","value":{"format":"MD","content":"给一棵树,求树的重心"}},{"title":"名词解释","value":{"format":"MD","content":"删除一个点,使得形成的多棵树中节点数最大的树的节点数最小。\n\n这个点即为树的重心。"}},{"title":"输入格式","value":{"format":"MD","content":"一行一个整数n,即树的节点个数(n\u003c\u003d5*10^4)\n\n接下来n-1行,每行两个整数,表示树上一条边。"}},{"title":"输出格式","value":{"format":"MD","content":"如果有多个重心,则按编号从小到大依次输出"}},{"title":"样例输入","value":{"format":"MD","content":"6\n1 2\n2 3\n2 5\n3 4\n3 6"}},{"title":"样例输出","value":{"format":"MD","content":"2 3 "}},{"title":"提示","value":{"format":"MD","content":"卡vector,建议用手写的链式前向星或邻接表"}}]}