UVA - 111 History Grading （动态规划：LCS）

题目连接

最长公共子序列

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAX_N = 21;
int N;
int ans[MAX_N], s[MAX_N], d[MAX_N][MAX_N];
int LCS()
{
memset(d, 0, sizeof(d));
for(int i = 0; i < N; i++)
for(int j = 0; j < N; j++)
if(ans[i] == s[j])
d[i+1][j+1] = d[i][j] + 1;
else
d[i+1][j+1] = max(d[i][j+1], d[i+1][j]);
return d

;
}
int main()
{
//freopen("in.txt", "r", stdin);
scanf("%d", &N);
int pos, i;
for(i = 1; i <= N; i++)
{
scanf("%d", &pos);
ans[pos-1] = i;
}
i = 1;
while(scanf("%d", &pos) != EOF)
{
s[pos-1] = i;
for(int i = 2; i <= N; i++)
{
scanf("%d", &pos);
s[pos-1] = i;
}
printf("%d\n", LCS());
}
return 0;
}