Cod sursa(job #1120922)
Utilizator | Data | 25 februarie 2014 10:47:12 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n,m,v1[1025],v2[1025],a[1025][1025],i,j;
int main()
{
fin>>n>>m;
for (i=1;i<=n;i++)
fin>>v1[i];
for (i=1;i<=m;i++)
fin>>v2[i];
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
if (v1[i]==v2[j])
a[i][j]=1+a[i-1][j-1];
else a[i][j]=max(a[i-1][j],a[i][j-1]);
fout<<a[n][m]<<'\n';
for (i=a[n][m];i>=1;i--)
fout<<v1[i]<<' ';
return 0;
}