Cod sursa(job #599378)

Utilizator andrianAndrian andrian Data 28 iunie 2011 16:17:16
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include <iostream>
#include <fstream>
#define nmax 1025
#define max(a,b) ((a)>(b))?(a):(b)

using namespace std;

int m, n, nr=0;
int a[nmax], b[nmax], d[nmax][nmax], s[nmax];

void citire(){
    int i;
    ifstream in("cmlsc.in");
    in >> n >> m;
    for(i=1;i<=n;++i)
        in >> a[i];
    for(i=1;i<=m;++i)
        in >> b[i];
    in.close();
}

void rezolv(){
    int i, j;
    for(i=1;i<=n;++i)
        for(j=1;j<=n;++j)
            if(a[i] == b[j]) d[i][j] = 1 + d[i-1][j-1];
            else d[i][j] = max(d[i][j-1], d[i-1][j]);
    for(i=n;i>0;)
        for(j=m;j>0;)
            if(d[i][j] == 1+d[i-1][j-1]){ s[++nr] = a[i--];--j;}
            else if(d[i][j] == d[i-1][j]) --i;
            else j--;
}

void afis(){
    ofstream out("cmlsc.out");
    out << nr << '\n';
    for(int i=nr;i>0;--i)
        out << s[i] << " ";
    out.close();
}

int main()
{
    citire();
    rezolv();
    afis();
    return 0;
}