Cod sursa(job #1465575)
| Utilizator | Data | 27 iulie 2015 17:18:29 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
int m,n;
int main()
{
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int q,k,x[1024],y[1024],poz[1024],k1=1,p=0;
f>>m>>n;
for(int i=1;i<=m;i++)f>>x[i];
for(int j=1;j<=n;j++)f>>y[j];
k=1;q=0;
for(int i=k1;i<=m;i++)
for(int j=k;j<=n;j++)
if(x[i]==y[j])
{
q++;poz[++p]=x[i];k=j;k1=i;
}
g<<q<<'\n';
for(int i=1;i<=p;i++)
g<<poz[i]<<" ";
f.close();g.close();
return 0;
}
