Cod sursa(job #626523)
| Utilizator | Data | 27 octombrie 2011 14:48:00 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int main()
{
int n,m,a[2000],b[2000],c[2000],z=1,i,j,k,x;
fin>>n>>m;
for(i=1;i<=n;i++)fin>>a[i];
for(j=1;j<=m;j++)fin>>b[j];
k=1;
for(i=1;i<=n;i++)
{
for(j=k;j<=m;j++)
if(a[i]==b[j]){
if(x!=i){c[z++]=a[i];
k=j;
x=i;
}
}
}
z--;
fout<<z<<"\n";
for(j=1;j<=z;j++)fout<<c[j]<<" ";
fin.close();
fout.close();
return 0;
}
