[UVA][樹形dp] 11695 - Flight Planning
Problem G - Flight Planning
Time limit: X seconds
The airline company NCPC Airways has flights to and from n
cities, numbered from 1 to n, around the entire world. However,
they only have n - 1 different flights (operating in both
directions), so in order to trav...
