Cod sursa(job #1414145)

Utilizator andrei_diaconuAndrei Diaconu andrei_diaconu Data 2 aprilie 2015 13:23:50
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <fstream>

#define NMax 1025

using namespace std;

ifstream f("cmlsc.in");
ofstream g("cmlsc.out");

int m, n, v1[NMax], v2[NMax], d[NMax][NMax], rec[NMax], k;

int getmax(int a, int b)
{
	if (a > b)
		return a;
	return b;
}

int main()
{
	f >> m >> n;

	for (int i = 1; i <= m; i++)
		f >> v1[i];

	for (int i = 1; i <= n; i++)
		f >> v2[i];

	for (int i = 1; i <= m; i++) {
		for (int j = 1; j <= n; j++) {
			if (v1[i] == v2[j])
				d[i][j] = d[i - 1][j - 1] + 1;
			else
				d[i][j] = getmax(d[i - 1][j], d[i][j - 1]);
		}
	}

	g << d[m][n]<<"\n";

	int i = m, j = n;

	while (i != 0 && j != 0) {
		if (v1[i] == v2[j]) {
			rec[++k] = v1[i];
			i--;
			j--;
		}
		else {
			if (d[i - 1][j] > d[i][j - 1])
				i--;
			else
				j--;
		}
	}

	for (int i = k; i >= 1; i--)
		g << rec[i] << " ";
}