Cod sursa(job #552790)

Utilizator valentina506Moraru Valentina valentina506 Data 12 martie 2011 20:49:38
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include<fstream>
using namespace std;
int n,m,i,j,a[1024],b[1024],c[1024][1024],maxim,sir[1024];
int main()
{
	ifstream f("cmlsc.in");
	ofstream g("cmlsc.out");
	f>>n>>m;
	for(i=1;i<=n;i++)
		f>>a[i];
	for(j=1;j<=m;j++)
		f>>b[j];
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
			if(a[i]==b[j])
				c[i][j]=c[i-1][j-1]+1;
			else
				c[i][j]=max(c[i-1][j],c[i][j-1]);
			g<<c[n][m]<<"\n";
			maxim=c[n][m];
			i=n,j=m;
			while(maxim)
			{
				if(a[i]==b[j]&&c[i][j]==maxim)
				{
					sir[maxim]=a[i];
					maxim--;
				}
				else
					if(c[i][j]>c[j][i])
						i--;
					else
						j--;
			}
			for(i=1;i<=c[n][m];i++)
				g<<sir[i]<<" ";
			return 0;
}