Cod sursa(job #698881)

Utilizator BarracudaFMI-Alex Dobrin Barracuda Data 29 februarie 2012 16:31:30
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include<fstream>
#define dim 1024
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int a[dim],b[dim],D[dim][dim],sol[dim],i,k,j,m,n;
inline int max(int a,int b){
	if(a>b)
		return a;
	return b;
}
int main (){
	
	f>>n>>m;
	for(i=1;i<=n;i++)
		f>>a[i];
	
	for(i=1;i<=m;i++)
		f>>b[i];
	
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++){
			if(a[i]==b[j])
				D[i][j]=1+D[i-1][j-1];
			else{
				D[i][j]=max(D[i-1][j],D[i][j-1]);
			}
		}
	i=n;
	j=m;
	k=0;
	while(i && j){
		if(a[i]==b[j]){
			sol[++k]=a[i];
			--i;
			--j;
		}
		else{
			if(D[i][j-1]>D[i-1][j])
				--j;
			else
				--i;
		}
	}
	g<<k<<"\n";
	for(i=k;i>=1;i--)
		g<<sol[i]<<" ";
	return 0;
}