Cod sursa(job #1185749)

Utilizator arcansielAlina Bratu arcansiel Data 16 mai 2014 18:44:48
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include<fstream>
#define NMAX 1025
using namespace std;

int n,m,i,a[NMAX],b[NMAX],lcs[NMAX][NMAX],sol[NMAX],k;
ofstream g("cmlsc.out");

void afisare()
{
	int j;
	g<<k<<'\n';
	for (j=k-1;j>=0;j--)
		g<<sol[j]<<' ';
}

void doLCS()
{
	int i,j;
	for (i=0;i<=n;i++)
		for (j=0;j<=m;j++)
		{
			if (i==0 || j==0)
				lcs[i][j]=0;
			else
			{
				if (a[i]==b[j])
					lcs[i][j]=lcs[i-1][j-1]+1;
				else
					lcs[i][j]=(lcs[i-1][j]>lcs[i][j-1]?lcs[i-1][j]:lcs[i][j-1]);
			}
		}
}

void backtrack()
{
	int i=n,j=m;
	while (i>0 && j>0)
	{
			if (a[i]==b[j])
			{
				sol[k++]=a[i];
				i--;
				j--;
			}
			else
				if (lcs[i-1][j]<lcs[i][j-1])
					j--;
				else
					i--;
	}
}

int main()
{
	ifstream f("cmlsc.in");
	f>>n>>m;
	for (i=1;i<n+m+1;i++)
		if (i<=n)
			f>>a[i];
		else
			f>>b[i-n];
	
	doLCS();
	backtrack();
	afisare();
	return 0;
}