Cod sursa(job #420881)

Utilizator dornescuvladVlad Eugen Dornescu dornescuvlad Data 20 martie 2010 18:29:45
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include<iostream>
#include<fstream>

using namespace std;

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

int n,m,a[1200],b[1200],D[1200][1200],i,j,sol[1200],nr;

int main()
{
	fin>>n>>m;
	for(i=1;i<=n;i++)
		fin>>a[i];
	for(i=1;i<=m;i++)
		fin>>b[i];
	
	for(i=0;i<n;i++)
		for(j=0;j<m;j++)
			D[i][j]=0;
	
	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]);
		}
		
	/*for(i=1;i<=n;i++)
	{
		for(j=1;j<=m;j++)
			fout<<D[i][j]<<" ";
		fout<<"\n";
	}*/
		
	fout<<D[n][m];
	int maxim=D[n][m];
	
	for(i=n;i>=1;i--)
		for(j=m;j>=1;j--)
			if (D[i][j] == maxim && (D[i][j-1] != maxim && D[i-1][j] != maxim)) sol[nr++] = a[i], maxim--;
	
	fout<<"\n";
	for(i=nr-1;i>=0;i--)
		fout<<sol[i]<<" ";
	
	return 0;
}