Cod sursa(job #1518688)

Utilizator sykesalinaPistol Alexandra Alina sykesalina Data 6 noiembrie 2015 08:46:07
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.93 kb
#include <fstream>
#include<iostream>
//ifstream in("cmlsc.in");
//ofstream out("cmlsc.out");
using namespace std;
int a[1025],b[1025],c[1025][1025],m,n,v[1025],k;
int main(){
    int i,j;
    cin>>n>>m;
    for(i=1;i<=m;i++)cin>>a[i];
    for(j=1;j<=n;j++)cin>>b[j];
    for(i=1;i<=m;i++)
        for(j=1;j<=n;j++)
            if(a[i]==b[j])c[i][j]=c[i-1][j-1]+1;
            else if(c[i-1][j]>=c[i][j-1])c[i][j]=c[i-1][j];
            else c[i][j]=c[i][j-1];
            cout<<c[n][m]<<endl;
            i=n;
            j=m;
            k=c[n][m];
            while(i&&j){
                if(a[i]==b[j]){
                    v[k--]=a[i];
                    i--;
                    j--;
                }
                else
                if(c[i-1][j]>=c[j][j-1])i--;
                else j--;
            }
            k=c[n][m];
            for(i=1;i<=k;i++)
            cout<<v[i]<<" ";
            return 0;
}