Algorithm title: UVA 10635 Prince and Princess (DP + LCS)

In a n x n chessboard, Prince and Princess plays a game. The squares in the chessboard are numbered 1, 2, 3 ... n*n, as shown below:

Prince stands in square 1, make p jumps and finally reach Square n*n. He enters a square at most once. So if we do x_p to denote the p-th Square he enters, then x₁, x₂, ... x p+1 are all different. Note that x₁ = 1 and x_p+1 = N*n. Princess does the similar thing-stands in square 1, make Q jumps and finally reach Square n*n . We use y₁, y₂ , ... y_q+1 to denote the sequence, and all q+1 number s are different.

Figure 2 belows show a 3x3 Square, a possible route for Prince and a different route for Princess.