Pagini recente » Cod sursa (job #223728) | Cod sursa (job #372632) | Cod sursa (job #1773337) | preONI 2005 runda #3 - solutii | Cod sursa (job #704782)
Cod sursa(job #704782)
#include<fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int a[1024], b[1024], n, m, d[1024][1024];
void Read()
{
fin >> n >> m;
for(int i = 1; i <= n; i++)
fin >> a[i];
for(int j = 1; j <= m; j++)
fin >> b[j];
}
void Cmlsc()
{
for(int i = 1; i <= n; i++)
d[i][0] = i;
for(int j = 1; j <= m; j++)
d[0][j] = j;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
if(a[i] == b[j])
d[i][j] = d[i - 1][j - 1] + 1;
else
d[i][j] = min(d[i][j - 1], d[i - 1][j]);
fout << d[n][m];
}
int main()
{
Read();
Cmlsc();
fin.close();
fout.close();
return 0;
}