Cod sursa(job #652156)

Utilizator galbenugalbenu dorin galbenu Data 23 decembrie 2011 09:06:57
Problema Cel mai lung subsir comun Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 1.28 kb
#include<fstream>
#define nmax 800
#define lmax 640000
using namespace std;
ifstream f("cmlsc.in",fstream::in);
ofstream g("cmlsc.out",fstream::out);
unsigned int a[nmax],b[nmax],c[nmax][nmax],sol[lmax],nrsol,maximul;
short int n,m;
unsigned int maxim(unsigned int a,unsigned int b)
{
    if(a>b)
        return a;
    else
        return b;
}
void citire()
{
    short int i;
    f>>n>>m;
    for(i=1; i<=n; i++)
        f>>a[i];
    for(i=1; i<=m; i++)
        f>>b[i];
}
void phd()
{
    short int i,j;
    for(i=1; i<=n; i++)
        for(j=1; j<=m; j++)
            if(a[i]==b[j])
            {
                c[i][j]=c[i-1][j-1]+1;
                if(c[i][j]>maximul)
               {
                   sol[++nrsol]=a[i];
                   maximul=c[i][j];
               }
            }
            else
                c[i][j]=maxim(c[i-1][j],c[i][j-1]);
}
void afis()
{
    g<<nrsol<<"\n";
    unsigned int i;
    for(i=1; i<=nrsol; i++)
        g<<sol[i]<<" ";
}
void afis_m()
{
    short int i,j;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        g<<c[i][j]<<" ";
        g<<"\n";
    }
    g<<"\n\n";
}
int main()
{
    citire();
    phd();
    //afis_m();
    afis();
    f.close();
    g.close();
    return 0;
}