UVA 111 History Grading

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;

const int MAXN = 1010;

int x[MAXN], y[MAXN];
int d[MAXN][MAXN];

int n, m;

void LCSlength(int n, int m)
{
	for(int i = 1; i <= n; i++) d[i][0] = 0;
	for(int i = 1; i <= m; i++) d[0][i] = 0;
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= m; j++) if(x[i] == y[j]) d[i][j] = d[i-1][j-1]+1;
		else d[i][j] = max(d[i-1][j], d[i][j-1]);
	printf("%d\n", d
[m]);
}

int main()
{
	int t;
	scanf("%d", &n);
	for(int i = 1; i <= n; i++)
	{
		scanf("%d", &t);
		x[t] = i;
	}
	while(~scanf("%d", &t))
	{
		y[t] = 1;
		for(int i = 2; i <= n; i++)
		{
			scanf("%d", &t);
			y[t] = i;
		}
		LCSlength(n, n);
	}
	return 0;
}