Cod sursa(job #1729934)

Utilizator andreis181andreis181 andreis181 Data 15 iulie 2016 21:06:28
Problema Cel mai lung subsir comun Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <iostream>
#include <fstream>
using namespace std;

#define maxim(a,b) ((a>b) ? a : b)

int m,n,a[50],b[50],c[50][50],bst,sir[50];

int main()
{
    ifstream f("cmlsc.in");
    ofstream g("cmlsc.out");
    f>>m>>n;
    int i,j;
    for(i=1;i<=m;i++)
        f>>a[i];
    for(i=1;i<=n;i++)
        f>>b[i];
    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]);
    for(i=m;i>=1;)
        for(j=n;j>=1;)
            if(a[i]==b[j])
            {
                sir[++bst]=a[i];
                --j;
                --i;
            }
            else
                if(c[i-1][j]<c[i][j-1])
                    --j;
                else
                    --i;
    g<<bst<<endl;
    for(i=bst;i>=1;i--)
        g<<sir[i]<<" ";
}