UVa 111 - History Grading

/*UVa 111 - History Grading
* 最长公共子序列
* */
import java.util.Scanner;

class Main {
static final int MAX = 25;

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] arr = new int[n + 1];
arr[0] = -1; // 保证st[0]!=arr[0]
for (int i = 1; i <= n; i++) {
arr[scanner.nextInt()] = i;
}
while (scanner.hasNext()) {
int[] st = new int[n + 1];
for (int i = 1; i <= n; i++)
st[scanner.nextInt()] = i;
int[][] d = new int[n + 1][n + 1];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (arr[i] == st[j])
d[i][j] = d[i - 1][j - 1] + 1;
else
d[i][j] = Math.max(d[i][j - 1], d[i - 1][j]);
}
}
System.out.println(d

);
}
}
}