Cod sursa(job #3167095)
| Utilizator | Data | 9 noiembrie 2023 23:01:08 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n,m,a[1025],b[1025],cont,rez[1025],sj=1;
bool ok;
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
{
fin>>a[i];
}
for(int i=1; i<=m; i++)
{
fin>>b[i];
}
for(int i=1; i<=n; i++)
{
ok=false;
for(int j=sj; j<=m && ok==false; j++)
{
if(a[i]==b[j])
{
rez[cont]=a[i];
cont++;
sj=j;
ok=true;
}
}
ok=false;
}
fout<<cont<<endl;
for(int i=0; i<cont; i++)
fout<<rez[i]<<" ";
return 0;
}
