Cod sursa(job #2607782)
| Utilizator | Data | 30 aprilie 2020 10:41:08 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int a[1025], b[1025];
int lcs[1030][1030];
int main()
{
int i, j, n, m, lgrez=0;
fin >> n >> m;
for(i=1; i<=n; ++i)
fin >> a[i];
for(i=1; i<=m; ++i)
fin >> b[i];
for(i=1; i<=n; ++i)
for(j=1; j<=m; ++j)
{
if(a[i]==b[j])
{
lcs[i][j]=1+max(lcs[i-1][j], lcs[i][j-1]);
}
else
lcs[i][j]=max(lcs[i-1][j], lcs[i][j-1]);
}
fout << lcs[n][m] << '\n';
return 0;
}
