Cod sursa(job #1873111)

Utilizator adriashkin.07alehandru69 adriashkin.07 Data 8 februarie 2017 19:53:36
Problema Cel mai lung subsir comun Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.52 kb
#include<bits/stdc++.h>

using namespace std;

int n,m,A[1030],B[1030], D[1030][1030],i,j;

int main()
{
	ifstream cin("cmlsc.in");
	ofstream cout("cmlsc.out");
	
	cin>>m>>n;
	
	for(i=1;i<=m;i++)
	  cin>>A[i];
	for(i=1;i<=n;i++)
	  cin>>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]);
	   
	   cout<<D[m][n]<<endl; 
	for(i=1;i<=n;i++)
	  if(D[m][i]!=D[m][i-1]) 
	   cout<<B[i]<<' ';
	   
	    return 0;
	
}