Cod sursa(job #1516727)

Utilizator razvann17Razvan Muresan razvann17 Data 3 noiembrie 2015 14:58:15
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include <iostream>
using namespace std;
int main()
{
    int j ,  i, n, m, a[100], b[100], s[100][100];
    cin>>n>>m;
    for( i=1; i<=n; i++)
     cin>>a[i];
    for( j=1; j<=m; j++)
     cin>>b[j];
    for( i=1; i<=n; i++)
        for( j=1; j<=m; j++)
            if(a[i]==b[j])
            {
                s[i][j]=s[i-1][j-1]+1;
                cout<<a[i]<<" ";
            }
            else s[i][j]=max(s[i-1][j], s[i][j-1]);
    cout<<"\n"<<s[n][m];
    return 0;
}