Mai intai trebuie sa te autentifici.
Cod sursa(job #2534420)
Utilizator | Data | 30 ianuarie 2020 16:09:13 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n,m,i,j,a[1001],b[1001],c[1001][1001],d[101],cnt=0,poz=0;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>a[i];
fin>>m;
for(i=1; i<=m; i++)
fin>>b[i];
for (i=1; i<=m; i++)
{
for (j=1; j<=n; j++)
{
c[i][j]=max(c[i-1][j],c[i][j-1]);
if (a[j]==b[i]){
c[i][j]++;
poz++;
d[poz]=a[j];
}
}
}
fout<<c[m][n]<<"\n";
for (i=1; i<=poz; i++)
fout<<d[i]<<" ";
}