hdu3534 树形dp(求树中两点之间的最大距离)

There are several test cases. The first line of each case contains only one integer N, means there are N nodes in the tree. N-1 lines follow, each line has three integers w,v and len, indicate that there is one edge between node w and v., and the length of the edge is len.

,幸福就是重复。每天跟自己喜欢的人一起,

hdu3534 树形dp(求树中两点之间的最大距离)

相关文章:

你感兴趣的文章:

标签云: