Cod sursa(job #3366627)

Utilizator Mirci0kRenchez Mircea Mirci0k Data 2 octombrie 2026 22:22:05
Problema Cel mai lung subsir comun Scor 20
Compilator cpp-32 Status done
Runda Arhiva educationala Marime 0.71 kb
#include <bits/stdc++.h>
using namespace std;
int m, n, aux, l;
int main(){
	ifstream fin("cmlsc.in");
	ofstream fout("cmlsc.out");
	
	fin>>m>>n;
	
	int a[m];
	int b[n];
	
	for(int i=0; i<m; i++){
		fin>>aux;
		a[i]=aux;
	}
	for(int i=0; i<n; i++){
		fin>>aux;
		b[i]=aux;
	}
	
	
	
	aux=0;
	l=0;
	
	for(int i=0; i<m; i++){
		for(int j=aux; j<n; j++){
			if(a[i]==b[j]){
				l++;
				aux=j;	
				continue;	
			}
		}
	}
	
	aux=0;
	int cmlsc[l];
	l=0;
	
	for(int i=0; i<m; i++){
		for(int j=aux; j<n; j++){
			if(a[i]==b[j]){
				cmlsc[l]=a[i];
				l++;
				aux=j;
				continue;		
			}
		}
	}
	
	fout<<l<<endl;
	
	for(int i=0; i<l; i++){
		fout<<cmlsc[i]<<" ";
	}
return 0;
}