{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"问题描述","value":{"format":"MD","content":"给出一个含有`n`个点的树。\n你从树上钦定三个不同的点`a,b,c`,如果一个边在其中两个点的简单路径上,它就是“好边”。你需要求出最多有多少个\"好边\",并且输出任一一种选定`a,b,c`的方案。"}},{"title":"输入格式","value":{"format":"MD","content":"第一行一个整数`n`。\n接下来`n-1`行每行两个数`a,b`表示一条边的两个端点。"}},{"title":"输出格式","value":{"format":"MD","content":"第一行一个数表示好边最多有多少个。\n第二行是三个数表示一种钦定`a,b,c`使得好边个数最多的方案。"}},{"title":"样例输入","value":{"format":"MD","content":"```plain\n8\n1 2\n2 3\n3 4\n4 5\n4 6\n3 7\n3 8\n```"}},{"title":"样例输出","value":{"format":"MD","content":"```plain\n5\n1 8 6\n```"}},{"title":"数据范围","value":{"format":"MD","content":"`3\u003c\u003dn\u003c\u003d2e5`"}},{"title":"Note","value":{"format":"MD","content":"样例对应的图片如下 \u003cspan class\u003d\"tex-font-style-bf\"\u003e\u003c/span\u003e:\n\u003cimg class\u003d\"tex-graphics\" SRC\u003d\"CDN_BASE_URL/52c30c912e51dd693c33c9d10836e3a3?v\u003d1580468245\" style\u003d\"max-width: 100.0%;max-height: 100.0%;\"\u003e\n"}}]}