Cod sursa(job #786879)

Utilizator monica11Szekely Monica monica11 Data 12 septembrie 2012 11:54:42
Problema Cel mai lung subsir comun Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.58 kb
#include<fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int n,m,i,j,b[1501],c[1501],a[100][100],sub[1501],x;
int main()
{
	f>>n>>m;
	for(i=1;i<=n;i++)
		f>>b[i];
	for(i=1;i<=m;i++)
		f>>c[i];
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
		{
			if(b[i]==c[j])
				a[i][j]=a[i-1][j-1]+1;
			else
				a[i][j]=max(a[i-1][j],a[i][j-1]);
		}
	i=n;
	j=m;
	while(a[i][j])
	{
		while(a[i][j]==a[i-1][j])
			i--;
		while(a[i][j]==a[i][j-1])
			j--;
		x++;
		sub[x]=b[i];
		i--;
		j--;
	}
	g<<a[n][m]<<"\n";
	for(i=x;i>=1;i--)
		g<<sub[i]<<" ";
}