Cod sursa(job #2195273)

Utilizator Sergiu1256Ionita Sergiu1256 Data 15 aprilie 2018 21:02:00
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include<bits/stdc++.h>
using namespace std;
int n,m,lsol,sol[2000],mat[1500][1500],a[2000],b[2000];
int main(){
	ifstream fin("cmlsc.in");
	cin>>n>>m;
	for(int i(0);i<n;cin>>a[++i]);
	for(int i(0);i<m;cin>>b[++i]);
	for(int i=1;i<=n;i++)
    	for(int j=1;j<=m;j++)
        	   if(a[i]==b[j]) mat[i][j]=1+mat[i-1][j-1];
        				else mat[i][j]=max(mat[i-1][j],mat[i][j-1]);
    int i=n,j=m;
	while(i!=0)
    	      if(a[i]==b[j]) sol[++lsol]=a[i],i--,j--;
       				   else  if(mat[i-1][j]<mat[i][j-1]) j--;
													else i--;
 	ofstream fout("cmlsc.out");
	 cout<<lsol<<endl;
	for(int i=lsol;i>=1;i--) cout<<sol[i]<<" ";
	return 0;
}