Cod sursa(job #2050914)

Utilizator horea4Cenan Horea horea4 Data 28 octombrie 2017 12:05:15
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int dp[1035][1035];
int s1[1025],s2[1025];
int aux[1026];
int k;
int l1,l2;
int main() {
	fin>>l1>>l2;
	for(int i=1;i<=l1;i++)fin>>s1[i];
	for(int i=1;i<=l2;i++)fin>>s2[i];
	for(int i=1;i<=l1;i++)
	  {
	  	for(int j=1;j<=l2;j++)
	  	{
	  		dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
	  		if(s1[i]==s2[j])
	  		{
	  			dp[i][j]=max(dp[i][j],dp[i-1][j-1]+1);
	  		}
	  	}
	  }
 
 
 
	  fout<<dp[l1][l2]<<"/n";
       for(int i=l1,j=l2,k=dp[l1][l2];i>0 && j>0;)
       {
       	if(s1[i]==s2[j])
	      	{  aux[k]=s1[i];
	      	k--;
	      	i--;
	      	j--;
	        }
	        if(dp[i][j-1]>dp[i-1][j-1])
	        j--;
	        else i--;
       }
       for(int i=1;i<=dp[l1][l2];i++)
       {
       	fout<<aux[i]<<" ";
       }
 
 
 
	return 0;
}