Cod sursa(job #788622)

Utilizator nicu701Nicu Badescu nicu701 Data 15 septembrie 2012 14:49:40
Problema Cel mai lung subsir comun Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 1 kb
#include <iostream>
#include <fstream>
#define Maxim(a,b) a>b?a:b
using namespace std;
fstream f("cmlsc.in", ios::in),
        g("cmlsc.out", ios::out);
int c[1024][1024], a[1024], b[1024];
void Print(int m, int n);
int main()
{
    int m, n, i, j;
    f>>m>>n;
    for(i=1;i<=m;i++)
        f>>a[i];
    for(j=1;j<=n;j++)
        f>>b[j];
    for(i=0;i<=m;i++)
        c[i][0]=0;
    for(j=0;j<=n;j++)
        c[0][j]=0;
    for(i=1;i<=m;i++)
        for(j=1;j<=n;j++)
        {
            if(a[i]==b[j])
                c[i][j]=1+c[i-1][j-1];
            else
                c[i][j]=Maxim(c[i-1][j], c[i][j-1]);
        }
    g<<c[m][n];
    g<<endl;
    Print(m,n);
    return 0;

}

void Print(int m, int n)
{
    if(m==0 || n==0)
        return;
    else if(c[m][n]==c[m-1][n-1]+1)
        {
            Print(m-1,n-1);
            g<<a[m]<<" ";
        }
        else if(c[m][n]==c[m-1][n])
                Print(m-1,n);
            else
                Print(m,n-1);
}