Cod sursa(job #897322)

Utilizator h2g2Ford Prefect h2g2 Data 27 februarie 2013 19:58:57
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.53 kb
#include <iostream>
#include <fstream>
#define nmax 1025
using namespace std;

int a[nmax], b[nmax];
int pre[nmax];

int cmlsc(int i, int j) {
	if(i==0 || j==0) return 0;
	
	if(a[i] == b[j]) {
		pre[i] = i-1;
		return cmlsc(i-1, j-1) + 1;
	}

	return max(cmlsc(i,j-1), cmlsc(i-1,j));
}


int main() {
	ifstream f("cmlsc.in");
	ofstream g("cmlsc.out");
	
	int n, m, i, j;
	
	f>>n>>m;
	for(i=1; i<=n; i++) f>>a[i];
	for(j=1; j<=m; j++) f>>b[j];
	
	g<<cmlsc(n, m)<<"\n";
	
	for(i=1; i<=n; i++) if(pre[i]) g<<a[i]<<" "; g<<"\n";
	
	return 0;
}