Add solution for UVA problem 116 Unidirectional TSP
dynamic programming.
Because the problem asks to output the shortest path (left to right), so I calculated
the recurrence from right to left.

pathCost(i, j) means the minimum weight of the path to the destination
from the position (i, j).