Pagini recente » Cod sursa (job #1143767) | Cod sursa (job #3226505) | Cod sursa (job #1694458) | Cod sursa (job #297337) | Cod sursa (job #3322554)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n,m,v[1030][1030],a[1030],b[1030];
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>a[i];
}
for(int i=1;i<=m;i++)
{
fin>>b[i];
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
if(a[i]==b[j])
v[i][j]=v[i-1][j-1]+1;
else
v[i][j]=max(v[i-1][j],v[i][j-1]);
}
for(int j=i+1;j<=m;j++)
v[i][j]=v[i][j-1];
}
fout<<v[n][m];
return 0;
}