Cod sursa(job #624366)

Utilizator vladul2Vlad B vladul2 Data 22 octombrie 2011 11:57:29
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include <fstream>

using namespace std;

int a[100][100],s1[100],s2[100],sub[150];
ifstream cin("txt.in");
ofstream cout("txt.out");

int main()
{
int n,m,i,j,x=0;
cin>>n>>m;
for(i=1;i<=n;i++)cin>>s1[i];
for(i=1;i<=m;i++)cin>>s2[i];


for(i=1;i<=n;i++)
    for(j=1;j<=m;j++)
        {
            if(s1[i]==s2[j]) a[i][j]=a[i-1][j-1]+1;
            else a[i][j]=max(a[i-1][j], a[i][j-1]);
        }
//for(i=1;i<=n;i++)
 //   {for(j=1;j<=m;j++)cout<<a[i][j]<<" ";cout<<endl;}
i=n;j=m;
while(a[i][j]){
    while(a[i][j]==a[i-1][j])i--;
    while(a[i][j]==a[i][j-1])j--;

    sub[++x]=s1[i];
    i--;j--;
    }
cout<<a[n][m]<<"\n";
while(x){cout<<sub[x]<<" ";x--;}

    return 0;
}