Cod sursa(job #2307180)

Utilizator The_one_and_onlyMironica Vasile The_one_and_only Data 23 decembrie 2018 22:07:22
Problema Cel mai lung subsir comun Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.62 kb
#include <fstream>
using namespace std;

ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int n, m, a[1025], b[1025], c[1025][1025], sol[1025];

int main() {
	cin>>n>>m;
	for(int i=1; i<=n; i++)
		cin>>a[i];
	for(int i=1; i<=m; i++)
		cin>>b[i];
	for(int i=1; i<=n; i++)
		for(int 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]);
	cout<<c[n][m]<<'\n';
	int k=0;
	while(c[n][m])
		if(a[n]==b[m])
			n--, m--, sol[k++]=a[n+1];
		else
			if(c[n-1][m]>c[n][m-1])
				n--;
			else
				m--;
	while(k--)
		cout<<sol[k]<<' ';
	return 0;
}