Poj 2250 Compromise(二)

2014-11-24 10:39:59 · 作者: · 浏览: 1
for(i=1; i<=len1; i++)//模版最长公共子串
for(j=1; j<=len2; j++)
{
if(strcmp(a[i-1],b[j-1]) == 0 )
{
len[i][j] = len[i-1][j-1] + 1;
index[i][j] = 0;
}
else
{
if(len[i-1][j] > len[i][j-1])
{
len[i][j] = len[i-1][j];
index[i][j] = -1;
}
else
{
len[i][j] = len[i][j-1];
index[i][j] = 1;
}
}
}
print(len1,len2);//从终点开始,递归打印
cout << endl;
cout << endl;
//cout << len[len1][len2] << endl;
}
return 0;
}