算法题：UVA 10635 Prince and Princess （dp + LCS）2014-04-12 csdn博客 accelerator_In an 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 use
xp to denote the
p-th square he enters, then
x1, x2, ... xp+1 are all different. Note that
x1 = 1 and
xp+1 = n*n. Princess does the similar thing - stands in square
1, make
q jumps and finally reach square
n*n. We use
y1, y2 , ... yq+1 to denote the sequence, and all
q+1 numbers are different.Figure
2 belows show a
3x3 square, a possible route for Prince and a different route for Princess.
易网时代-编程资源站