Dwylkz

Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23728    Accepted

Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4658

N皇后问题Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1753    Accepted Submission(s):

divide and conquer on tree. #include #include #include #include #include #include using namespace std; const int N = 5e4+10; const int K = 32; typedef long long LL; struct edge_t { int v, to

for each tree u, maintain five stuff:   p: the longest upper path start from u .   h: the diameter of the global tree after cut tree u.   f: the diameter of tree u.   d[0]: the longest lower path