Cod sursa(job #2514272)
Utilizator | Data | 25 decembrie 2019 00:26:43 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int m,n,a[1030],b[1030],d[1030][1030],i,j;
int main()
{
fin>>m>>n;
for(i=1;i<=m;i++)
fin>>a[i];
for(i=1;i<=n;i++)
fin>>b[i];
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
if(a[i]==b[j])
d[i][j]=d[i-1][j-1]+1;
else d[i][j]=max(d[i-1][j],d[i][j-1]);
fout<<d[m][n]<<'\n';
for(i=1;i<=n;i++)
if(d[m][i]>d[m][i-1])
fout<<b[i]<<" ";
return 0;
}