Cod sursa(job #2163856)
| Utilizator | Data | 12 martie 2018 20:14:57 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int n, m, i, a[1030], b[1030], mat[1030][1030], j;
int main()
{
in>>m>>n;
for(i=1; i<=m; ++i)
in>>a[i];
for(i=1; i<=n; ++i)
in>>b[i];
for(i=1; i<=m; ++i)
{
for(j=1; j<=n; ++j)
{
if(a[i]==b[j])
{
out<<a[i]<<" ";
mat[i][j]=mat[i-1][j-1]+1;
}
else
{
if(mat[i][j-1]>mat[i-1][j])
mat[i][j]=mat[i][j-1];
else
mat[i][j]=mat[i-1][j];
}
}
}
return 0;
}
