tree illustration vector

# Include Using namespace STD;Int N, K;Vector Int DP [1000007], depth [1000007], ANS [1000007]; // DP [I] indicates the depth of the leaf node closest to I, depth [I] indicates taking I as the root and returning to the number of leaf nodes that I can reach. ans [I] indicates taking I as the root, and the maximum number of leaf nodes can be reached.Void DFS (INT now ){If (! Son [now]. Size () {// itself is a leaf nodeDepth [now] = 0;DP [now] = 1;Return

Submission timeout .. I really think there is nothing to optimize... it can be changed back to the bottom of the BFS .. but it's troublesome. Remember a bunch of things .. look at discuss to know the main reason for the vector .. into a handwritten linked list .. after ms, select any vertex as the root of the tree... count the number of subtree elements of each vertex .. for vertices that are not root .. su

Submission timeout .. I really think there is nothing to optimize... it can be changed back to the bottom of the BFS .. but it's troublesome. remember a bunch of things .. look at discuss to know the main reason for the vector .. into a handwritten linked list .. after Ms, select any vertex as the root of the tree... count the number of subtree elements of each vertex... "/> #include #include #inc