Cod sursa(job #1873315)

Utilizator adriashkin.07alehandru69 adriashkin.07 Data 8 februarie 2017 22:33:49
Problema Cel mai lung subsir comun Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include<bits/stdc++.h>

using namespace std;

int n,m,A[1030],B[1030],rs[1030], D[1030][1030],i,j,x;
	ifstream in("cmlsc.in");
	ofstream out("cmlsc.out");
int main()
{

	in>>m>>n;
	
	for(i=1;i<=m;i++)
	  in>>A[i];
	for(i=1;i<=n;i++)
	  in>>B[i];
	  
	for(i=1;i<=m;i++)
	  for(j=1;j<=n;j++)
	   if(A[i]==B[j])
	     D[i][j]= ++D[i-1][j-1];
	    else D[i][j]=max(D[i-1][j],D[i][j-1]);
	   
	   out<<D[m][n]<<endl; 
	
    for(i=m,j=n;i && j;)
      if(A[i]==B[j]) {
	  rs[++x]=A[i];
      i--;
      j--;}
	  else 
	  
	  	if(D[i-1][j]<D[i][j-1])
	  	  j--;
	  	else i--;
	  	out<<rs[x];
	for(i=x-1;i;i--)
	 out<<" "<<rs[i];
	   
	    return 0;
	
}