Cod sursa(job #647250)

Utilizator CeachiCeachi Bogdan Ceachi Data 11 decembrie 2011 12:56:29
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include<fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int a[1025],b[1025],c[1025][1025],m,n,sol[1025];
int main() {
	fin>>n>>m;
int i,j;
for(i=1;i<=n;i++) fin>>a[i];
for(i=1;i<=m;i++) fin>>b[i];

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][j-1]>=c[i-1][j]) c[i][j]=c[i][j-1];
		else c[i][j]=c[i-1][j];
	}
fout<<c[n][m]<<"\n";
int k=c[n][m];
i=n;
j=m;
while(i&&j) {
	if(a[i]==b[j]) {
		sol[k]=a[i];
		k--;
		i--;
		j--;
	}
	else if(c[i][j-1]>=c[i-1][j]) j--;
	else i--;
}
for(i=1;i<=c[n][m];i++) fout<<sol[i]<<" ";
return 0;
}