Cod sursa(job #486913)

Utilizator mateiuliIulian mateiuli Data 23 septembrie 2010 09:49:31
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.54 kb
#include <fstream.h>
#include <iostream.h>
#include "lib.h"

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

int m,n;

int main() {
	int lp=1, vlp=1;
	fin>>m>>n;
	int c[m+n];
	memset(c,0,sizeof(c));
	int a[m+1], b[n+1];
	for(int i=1;i<=m;i++) 
		fin>>a[i];
	for(int i=1;i<=n;i++)
		fin>>b[i];
	for(int i=1;i<=m;i++) {
		for(int j=lp;j<=n;j++) {
			if(a[i] == b[j]) {
				c[vlp]=a[i];
				vlp++;
				lp=j;
				j=n+1; //ca sa iasa din for j
			}
		}
	}
	fout<<vlp-1<<'\n';
	for(int i=1;i<vlp; i++)
		fout<<c[i]<<" ";
}