Cod sursa(job #2605681)

Utilizator Gliumarin negai Gliu Data 25 aprilie 2020 17:23:45
Problema Cel mai lung subsir comun Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.45 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream in("cmlsc.in");
ofstream out("cmlsc.out");

int main(){
int m,n,c=0,vv=0,ii=0;
in >>m>>n;

int a[m],b[n],dd[n];
for(int i=0;i<m;i++){
	in >>a[i];
}
for(int i=0;i<n;i++){
	in >>b[i];
}
for(int i=0;i<m;i++){
	for(int j=ii;j<n;j++){
	if(a[i] == b[j]){
		c++;
		dd[vv]=a[i];
		vv++;
		ii=j;
	}
}
}
out <<c<<"\n";
for(int i=0;i<vv;i++){
	out <<dd[i]<<" ";
}
}