Cod sursa(job #2055867)

Utilizator danielsociuSociu Daniel danielsociu Data 3 noiembrie 2017 20:50:45
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <iostream>
#include <fstream>
using namespace std;

ifstream inf("cmlsc.in");
ofstream oinf("cmlsc.out");

int main()
{
    int a[1024],b[1024],n,m,x[1024],sol=0,c[1024][1024];
    inf>>n>>m;
    for(int i=1;i<=n; i++) {inf>>a[i];c[0][i]=0;}
    for(int i=1;i<=m; i++) {inf>>b[i];c[i][0]=0;}

    for(int i=1;i<=n; i++)
        for(int j=1;j<=m; j++){
            if(a[i]==b[j])
                c[i][j]=1+c[i-1][j-1];
            else
                c[i][j]= max(c[i-1][j],c[i][j-1]);
        }
    for(int i=n;i;)
        for(int j=m;j;){
            if(a[i]==b[j])
                x[++sol]=a[i];
            else if(c[i-1][j]>c[i][j-1])
                i--;
            else
                j--;
        }
    oinf<<c[n][m]<<"\n";
    for(int i=1;i<=c[n][m];i++)
        oinf<<x[i]<<" ";
    return 0;
}