UVA 10066 - The Twin Towers(最长公共子序）

#include <stdio.h>
#include <string.h>
int p[101][101];
int str1[101],str2[101];
int main()
{
int i,j,n,m,num = 0;
while(scanf("%d%d",&n,&m)!=EOF)
{
if(!n && !m)break;
num ++;
memset(p,0,sizeof(p));
for(i = 0; i <= n-1; i ++)
scanf("%d",&str1[i]);
for(i = 0; i <= m-1; i ++)
scanf("%d",&str2[i]);
for(i = 1; i <= n; i ++)
for(j = 1; j <= m; j ++)
{
if(str1[i-1] == str2[j-1])
{
p[i][j] = p[i-1][j-1]+1;
}
else if(p[i][j-1] > p[i-1][j])
{
p[i][j] = p[i][j-1];
}
else
{
p[i][j] = p[i-1][j];
}
}
printf("Twin Towers #%d\nNumber of Tiles : %d\n",num,p
[m]);
printf("\n");
}
return 0;
}