Cod sursa(job #536565)

Utilizator Oancea.CatalinOancea Catalin Oancea.Catalin Data 18 februarie 2011 19:51:38
Problema Cel mai lung subsir comun Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include<fstream>
using namespace std;
int d[1025][1025], i, j, n, m, a[1025], b[1025];
fstream f("cmlsc.in", ios::in), g("cmlsc.out", ios::out);
int maxim( 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];
	d[0][0]=0;
	for(i=1; i<=n; i++)
	{
		for(j=1; j<=m; j++)
		{
			if(a[i]==b[j])
				d[i][j]=d[i-1][j-1]+1;
			else
				d[i][j]=maxim(d[i-1][j], d[i][j-1]);
		}
	}
	g<<d[n][m]<<endl<<endl;
	int cnt=1;
	for(i=1; i<=n; i++)
	{
		for(j=1; j<=m; j++)
			if(d[i][j]==cnt)
			{
				g<<a[i]<<" ";
				cnt++;
			}
	}
	
}