Cod sursa(job #641842)

Utilizator OanaCristinaFlorescu Oana Cristina OanaCristina Data 29 noiembrie 2011 18:12:10
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");

int a[1025],b[1025],m,n,c[1025][1025],sol[1025];

int main()
{
	in>>n>>m;
	for(int i=1;i<=n;i++)
		in>>a[i];
	for(int i=1;i<=m;i++)
		in>>b[i];
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			if(a[i]==b[j])
				c[i][j]=c[i-1][j-1]+1;
			else
				if(c[i][j-1]>=c[i-1][j])
					c[i][j]=c[i][j-1];
				else
					c[i][j]=c[i-1][j];
	out<<c[n][m]<<endl;
	int i=n,j=m,k=c[n][m];
	while(i&&j)
	{
		if(a[i]==b[j])
		{
			sol[k]=a[i];
			k--;
			i--;
			j--;
		}
		else
			if(c[i][j-1]>=c[i-1][j])
				j--;
			else
				i--;
	}
	for(int i=1;i<=c[n][m];i++)
		out<<sol[i]<<" ";
	return 0;
}