hdu6446 Tree and Permutation【推公式+dfs】
Problem Description
There are N vertices connected by N−1 edges, each edge has its own length.
The set { 1,2,3,…,N } contains a total of N! unique permutations, let’s say the i -th permutation is Pi ...
原创
2018-08-26 19:43:17 ·
422 阅读 ·
0 评论