Cod sursa(job #1558577)

Utilizator theodor.moroianuTheodor Moroianu theodor.moroianu Data 29 decembrie 2015 13:26:04
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <fstream>
using namespace std;

const int NMAX = 1025;
int a[NMAX], b[NMAX];
int d[NMAX][NMAX];
int r[NMAX], contor = 0;

int max(int x, int y) {
	if (x > y)
		return x;
	return y;
}

ofstream out("cmlsc.out");

int main() {
	int n, m;
	ifstream in("cmlsc.in");
	in >> n >> m;
	for (int i = 1; i <= n; i++)
		in >> a[i];
	for (int i = 1; i <= m; i++)
		in >> b[i];
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (a[i] == b[j])
				d[i][j] = 1 + d[i - 1][j - 1];
			else
				d[i][j] = max(d[i - 1][j], d[i][j - 1]);
		}
	}
	in.close();
	out << d[n][m] << '\n';
	for (int i = n, j = m; i != 0; ) {
		if (a[i] == b[j]) {
			r[contor++] = a[i];
			i--;
			j--;
		}
		else {
			if (d[i - 1][j] >= d[i][j - 1])
				i--;
			else
				j--;
		}
	}
	for (int i = contor - 1; i >= 0; i--)
		out << r[i] << ' ';
	out.close();
	return 0;
}