Cod sursa(job #2676620)
| Utilizator | Data | 24 noiembrie 2020 18:10:21 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#define NMAX 1024
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int M, N;
int A[NMAX], B[NMAX], C[NMAX];
int lgh;
int i, j , poz, k;
int main()
{
f>>M>>N;
for(i=1; i<=M; i++)
f>>A[i];
for(i=1; i<=N; i++)
f>>B[i];
int poz=1;
for(i=1; i<=M; i++)
for(j=poz; j<=N; j++)
if(B[i]==A[j])
{
C[++k]=A[j];
lgh++;
poz=i+1;
}
g<<lgh<<endl;
for(int i=1; i<=k; i++)
g<<C[i]<<" ";
return 0;
}
