\u9898\u610f：\u7ed9\u4e00\u4e2a\u6811，\u53ef\u4ee5\u4ece\u91cc\u9762\u5220\u53bb\u4e24\u4e2a\u70b9，\u4f7f\u8fde\u901a\u5757\u6570\u91cf\u6700\u5927<\/p>\n
\u601d\u8def：\u9898\u89e3：CF2063C Remove Exactly Two – \u6d1b\u8c37\u4e13\u680f<\/p>\n
\u8fd9\u9053\u9898\u5f88\u5bb9\u6613\u60f3\u5230，\u76f4\u63a5\u5220\u53bb\u5ea6\u6700\u591a\u7684\u4e24\u4e2a\u70b9\u5c31\u884c\u4e86，\u4f46\u662f\u8fd9\u5e76\u4e0d\u5bf9，\u56e0\u4e3a\u76f8\u90bb\u70b9\u88ab\u5220\u53bb\u4e4b\u540e，\u4f1a\u5bfc\u81f4\u81ea\u5df1\u7684\u5ea6\u6570-1，\u6240\u4ee5\u5220\u53bb\u7684\u7b2c\u4e00\u4e2a\u70b9\u548c\u7b2c\u4e8c\u70b9\u90fd\u8981\u597d\u597d\u8003\u8651，\u672c\u4eba\u5c31\u662f\u6ca1\u8003\u8651\u7b2c\u4e00\u4e2a\u70b9\u5bf9\u7b2c\u4e8c\u4e2a\u70b9\u7684\u5f71\u54cd，\u7b2c\u4e00\u4e2a\u70b9\u9009\u62e9\u9519\u4e86，\u53ef\u80fd\u7b2c\u4e8c\u70b9\u6c38\u8fdc\u9009\u4e0d\u51fa\u6700\u4f73，\u53cd\u4f8b\u5c31\u662f\u4e09\u4e2a\u5ea6\u76f8\u540c\u7684\u70b9\u5728\u4e00\u8d77，\u4f60\u4e0d\u80fd\u9009\u4e2d\u95f4\u90a3\u4e2a<\/p>\n
\u56e0\u6b64\u8f6c\u6362\u601d\u8def，\u7b2c\u4e00\u4e2a\u70b9\u4e0d\u8d2a\u5fc3\u9009，\u800c\u662f\u66b4\u529b\u679a\u4e3e，\u7b2c\u4e8c\u4e2a\u70b9\u8d2a\u5fc3\u9009\u62e9\u5373\u53ef，\u4e0d\u80fd\u4e24\u4e2a\u70b9\u90fd\u8d2a\u5fc3\u9009，\u662f\u4e0d\u6b63\u786e\u7684，\u8fde\u901a\u5757\u53ef\u4ee5\u76f4\u63a5\u8ba1\u7b97\u5f97\u5230，\u4e5f\u597d\u60f3<\/p>\n
\u4ee3\u7801：<\/p>\n
#include <bits\/stdc++.h>
\nusing namespace std;
\n#define int long long
\n#define IOS \\\\
\nstd::ios::sync_with_stdio(0); \\\\
\nstd::cin.tie(0); \\\\
\nstd::cout.tie(0)<\/p>\n
const int N = 3e5 + 5;
\nconst int INF = 1e18;
\nconst int MOD = 998244353;
\n\/\/ const int MOD=1e9+7;
\n\/\/ const int MOD=100003;
\nconst int maxn=5e5+10;<\/p>\n
std::vector<int> ve[N];
\nint a[N];<\/p>\n
void solve(){
\n int n;
\n std::cin >> n;<\/p>\n
for(int i=1;i<=n;i++){
\n a[i]=0;
\n ve[i].clear();
\n }
\n for(int i=0;i<n-1;i++){
\n int x,y;
\n std::cin >> x >> y;
\n ve[x].push_back(y);
\n ve[y].push_back(x);
\n a[x]++,a[y]++;
\n }<\/p>\n
multiset<int> se;
\n for(int i=1;i<=n;i++){
\n se.insert(a[i]);
\n }
\n int ans=0;
\n for(int i=1;i<=n;i++){
\n int sum=1;
\n se.erase(se.find(a[i]));
\n for(auto v : ve[i]){
\n se.erase(se.find(a[v]));
\n se.insert(a[v]-1);
\n }
\n sum+=a[i]-1;
\n sum+=*se.rbegin()-1;
\n for(auto v : ve[i]){
\n se.erase(se.find(a[v]-1));
\n se.insert(a[v]);
\n }
\n se.insert(a[i]);
\n ans=std::max(sum,ans);
\n }
\n std::cout << ans << '\\\\n';<\/p>\n
}<\/p>\n
signed main()
\n{
\nIOS;<\/p>\n
int t = 1;
\nstd::cin >> t;
\nwhile (t–)
\n{
\nsolve();
\n}
\n} <\/p>\n","protected":false},"excerpt":{"rendered":"
\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb440\u6b21\u3002\u8fd9\u9053\u9898\u5f88\u5bb9\u6613\u60f3\u5230\uff0c\u76f4\u63a5\u5220\u53bb\u5ea6\u6700\u591a\u7684\u4e24\u4e2a\u70b9\u5c31\u884c\u4e86\uff0c\u4f46\u662f\u8fd9\u5e76\u4e0d\u5bf9\uff0c\u56e0\u4e3a\u76f8\u90bb\u70b9\u88ab\u5220\u53bb\u4e4b\u540e\uff0c\u4f1a\u5bfc\u81f4\u81ea\u5df1\u7684\u5ea6\u6570-1\uff0c\u6240\u4ee5\u5220\u53bb\u7684\u7b2c\u4e00\u4e2a\u70b9\u548c\u7b2c\u4e8c\u70b9\u90fd\u8981\u597d\u597d\u8003\u8651\uff0c\u672c\u4eba\u5c31\u662f\u6ca1\u8003\u8651\u7b2c\u4e00\u4e2a\u70b9\u5bf9\u7b2c\u4e8c\u4e2a\u70b9\u7684\u5f71\u54cd\uff0c\u7b2c\u4e00\u4e2a\u70b9\u9009\u62e9\u9519\u4e86\uff0c\u53ef\u80fd\u7b2c\u4e8c\u70b9\u6c38\u8fdc\u9009\u4e0d\u51fa\u6700\u4f73\uff0c\u53cd\u4f8b\u5c31\u662f\u4e09\u4e2a\u5ea6\u76f8\u540c\u7684\u70b9\u5728\u4e00\u8d77\uff0c\u4f60\u4e0d\u80fd\u9009\u4e2d\u95f4\u90a3\u4e2a\u3002\u56e0\u6b64\u8f6c\u6362\u601d\u8def\uff0c\u7b2c\u4e00\u4e2a\u70b9\u4e0d\u8d2a\u5fc3\u9009\uff0c\u800c\u662f\u66b4\u529b\u679a\u4e3e\uff0c\u7b2c\u4e8c\u4e2a\u70b9\u8d2a\u5fc3\u9009\u62e9\u5373\u53ef\uff0c\u4e0d\u80fd\u4e24\u4e2a\u70b9\u90fd\u8d2a\u5fc3\u9009\uff0c\u662f\u4e0d\u6b63\u786e\u7684\uff0c\u8fde\u901a\u5757\u53ef\u4ee5\u76f4\u63a5\u8ba1\u7b97\u5f97\u5230\uff0c\u4e5f\u597d\u60f3\u3002\u9898\u610f\uff1a\u7ed9\u4e00\u4e2a\u6811\uff0c\u53ef\u4ee5\u4ece\u91cc\u9762\u5220\u53bb\u4e24\u4e2a\u70b9\uff0c\u4f7f\u8fde\u901a\u5757\u6570\u91cf\u6700\u5927\u3002_codeforces round 1000 (div. 2)<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[427],"topic":[],"class_list":["post-50643","post","type-post","status-publish","format-standard","hentry","category-server","tag-427"],"yoast_head":"\n