Cod sursa(job #1093431)
| Utilizator | Data | 27 ianuarie 2014 23:30:20 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int a[1024],b[1024],m,n,k,i,j,v[1024],c=0;
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=m;i++)
f>>b[i];
k=1;
for(i=1;i<=n;i++)
{
for(j=k;j<=m;j++)
if(a[i]==b[j])
{
c++;
v[c]=b[j];
k=j;
}
}
g<<c<<'\n';
for(i=1;i<=c;i++)
g<<v[i]<<' ';
f.close();
g.close();
return 0;
}
