UVA 111 History Grading

#include <map>
#include <set>
#include <list>
#include <cmath>
#include<cctype>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b)
{
return a % b == 0 ? b : gcd(b, a % b);
}
int res[30],order[30],dp[30][30];
int main()
{
int n;int tmp;
scanf("%d",&n);
for (int i=0;i<n;i++)
{
scanf("%d",&tmp);
order[tmp]=i+1;//´æ´¢Ë³Ðò
}

while (scanf("%d",&tmp)!=EOF)
{
int cas=1;
res[tmp]=cas++;
for (int i=1;i<n;i++)
{
scanf("%d",&tmp);
res[tmp]=cas++;
}
//for (int i=1;i<=n;i++) printf("%d ",order[i]);putchar('\n');
//for (int i=1;i<=n;i++) printf("%d ",res[i]);putchar('\n');
memset(dp,0,sizeof(dp));
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
{
if (order[i]==res[j])
dp[i][j]=dp[i-1][j-1]+1;
else
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
printf("%d\n",dp

);
}
return 0;
}