Cod sursa(job #701803)

Utilizator ssebisSebastian Scinteie ssebis Data 1 martie 2012 17:54:34
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.6 kb
#include <fstream>
using namespace std;
int a[1025],b[1025],d[1025][1025],outing[1025],c;
int main()
{
	int i,j,m,n;
	
	ifstream f("cmlsc.in");
	ofstream g("cmlsc.out");
	
	f>>m>>n;
	for(i=1;i<=m;i++)
		f>>a[i];
	for(i=1;i<=n;i++)
		f>>b[i];
	
	for(i=1;i<=m;i++)
		for(j=1;j<=n;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=m,j=n;i; )
		if(a[i]==b[j]) 
			outing[++c]=a[i],--i,--j;
		else if(d[i-1][j]<d[i][j-1]) 
			--j;
		else --i;
	
	g<<c<<'\n';
	for (i=c;i;i--)
		g<<outing[i]<<' ';
	f.close();g.close();
	return 0;
}