Cod sursa(job #704110)
| Utilizator | Data | 2 martie 2012 16:28:20 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
int a[1024],b[1024],i,j,n,m,c[1024][1024],sol[1024],k;
int main()
{ifstream f("cmlsc.in");
ofstream h("cmlsc.out");
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=m;i++)
f>>b[i];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(a[i]==b[j])
{c[i][j]=c[i-1][j-1]+1;
k++;
sol[k]=a[i];}
else
if(c[i][j-1]>c[i-1][j])
c[i][j]=c[i][j-1];
else
c[i][j]=c[i-1][j];
h<<c[n][m];
h<<"\n";
for(i=1;i<=k;i++)
h<<sol[i]<<" ";
return 0;}