Cod sursa(job #1799122)
| Utilizator | Data | 5 noiembrie 2016 19:58:06 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 1.17 kb |
#include <fstream>
using namespace std;
int c[1050][1050];
int x[1050];
int v[1050];
int l[1050];
int n,m;
int main()
{
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
fin>>n>>m;
for(int i=1; i<=n; i++)
{
fin>>v[i];
c[i][0]=0;
}
for(int i=1; i<=m; i++)
{
fin>>x[i];
c[0][i]=0;
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
if(v[i]==x[j])
{
c[i][j]=c[i-1][j-1]+1;
}
else
{
c[i][j] = c[i-1][j]>c[i][j-1]?c[i-1][j]:c[i][j-1];
}
}
}
int p=0;
int q=m;
int z=n;
int k=c[n][m];
while(k)
{
if(v[z]==x[q])
{
l[k--]=v[z];
z--;
q--;
}
else
{
if(c[z-1][q]>c[z][q-1])
{
z--;
}
else
{
q--;
}
}
}
fout<<c[n][m]<<"\n";
for(int i=1;i<=c[n][m];i++)
{
fout<<l[i]<<" ";
}
return 0;
}
