Cod sursa(job #899456)

Utilizator acelasiStanciu Rares acelasi Data 28 februarie 2013 14:36:30
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.94 kb
#include <iostream>
#include <fstream>
using namespace std;


int main()
{
    int a[1025],b[1025],l[1025],m,n,i,k,j,max,mx,t,x;
    ifstream f("cmlsc.in");
    ofstream g("cmlsc.out");
    f>>m>>n; for(i=1;i<=m;i++) f>>a[i]; for(i=1;i<=n;i++) f>>b[i]; f.close(); //DATE DE INTRARE


    if(m>n)
    {
        k=m;
        mx=0;
        for(i=1;i<=n;i++) l[i]=0;
        for(i=n;i>=1;i--)
        {
            for(j=k;j>=1;j--)
            {
                if(b[i]==a[j])
                {

                    l[i]=mx+1;
                    mx++;
                    k=j;
                }
            }
        }
        //AFISARE
        max=l[1]; t=1;
        for(i=2;i<=n;i++)
            if(l[i]>max) { l[i]=max; t=i; }
        g<<max<<"\n";
        for(i=t;i<=n;i++)
            if(l[i]==max)
            {
                mx=l[i];
                g<<b[i]<<" ";
                for(j=i+1;j<=n;j++)
                    if(l[j]==mx-1)
                    {
                        g<<b[j]<<" ";
                        mx--;
                    }
            }

    }
    else
    {
        k=n;
        mx=0;
        for(i=1;i<=m;i++) l[i]=0;
        for(i=n;i>=1;i--)
        {
            for(j=k;j>=1;j--)
            {
                if(a[i]==b[j])
                {

                    l[i]=mx+1;
                    mx++;
                    k=j;
                }
            }
        }

        max=l[1]; t=1;
        for(i=2;i<=m;i++)
            if(l[i]>max) { l[i]=max; t=i; }
        g<<max<<"\n";
        for(i=t;i<=m;i++)
            if(l[i]==max)
            {
                mx=l[i];
                g<<a[i]<<" ";
                for(j=i+1;j<=m;j++)
                    if(l[j]==mx-1)
                    {
                        g<<a[j]<<" ";
                        mx--;
                    }
            }

    }



    g<<"\n";
    g.close();
    return 0;
}