Cod sursa(job #1039383)

Utilizator L.DanielLungu Daniel L.Daniel Data 22 noiembrie 2013 22:28:17
Problema Cel mai lung subsir comun Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include<fstream>
using namespace std;
int main()
{
	fstream f("cmlsc.in", ios::in);
	fstream g("cmlsc.out", ios::out);
	int c[1024][1024], a[1024], b[1024], i, n, m, j, k;
	f >> n >> m;
	for (i = 1; i <= n; i++)
	{
		f >> a[i];
		c[i][0] = 0;
	}
	for (j = 1; j <= m; j++)
	{
		f >> b[j];
		c[0][j] = 0;
	}
	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 if (c[i - 1][j] > c[i][j - 1])c[i][j] = c[i - 1][j];
	else c[i][j] = c[i][j - 1];
	g << c[n][m] << endl;
	k = 0;
	for (i = 1; i <= n;i++)
	for (j = 1; j <= m;j++)
	if (c[i][j] > k)
	{
		g << a[i] << " ";
		k = c[i][j];
	}

	return 0;
}