## HDU 6044 Limited Permutation

##### Multi-University Training Team 1-1012虚建笛卡尔树
Time Limit: 4000/2000 MS (Java/Others) （更多…）

（更多…）

## HDU 4034 Graph

Time Limit: 2000/1000 MS (Java/Others)

#### Problem Description

Everyone knows how to calculate the shortest path in a directed graph. In fact, the opposite problem is also easy. Given the length of shortest path between each pair of vertexes, can you find the original graph? （更多…）