CF1796E.Colored Subgraphs
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Monocarp has a tree, consisting of n vertices.
He is going to select some vertex r and perform the following operations on each vertex v from 1 to n :
- set dv equal to the distance from v to r (the number of edges on the shortest path);
- color v some color.
A nice coloring satisfies two conditions:
- for each pair of vertices of the same color (v,u) , there exists a path from v to u that only visits vertices of the same color;
- for each pair of vertices of the same color (v,u) , dv=du .
Note that Monocarp can choose any amount of different colors he wants to use.
For each used color, he then counts the number of vertices of this color. The cost of the tree is the minimum of these numbers.
What can be the maximum cost of the tree?
输入格式
The first line contains a single integer t ( 1≤t≤104 ) — the number of testcases.
The first line of each testcase contains a single integer n ( 3≤n≤2⋅105 ) — the number of vertices in the tree.
Each of the next n−1 lines contains two integers v and u ( 1≤v,u≤n ) — the description of an edge.
The given edges form a tree. The sum of n over all testcases doesn't exceed 2⋅105 .
输出格式
For each testcase print a single integer — the maximum possible cost of the tree.
输入输出样例
输入#1
4 4 1 2 2 3 3 4 5 1 2 1 3 1 4 1 5 3 1 3 3 2 7 3 2 2 5 7 5 3 1 1 6 1 4
输出#1
4 1 3 3