Cod sursa(job #1789552)

Utilizator Andrei27CCsatlos Andrei Andrei27C Data 27 octombrie 2016 09:43:08
Problema Cel mai lung subsir comun Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 1.31 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int n,i,j,y,a[1025],k,ok=0,m,x,b[1025],ma=0,v[1025][1025],c[1025];
int main()
{
    in>>n>>m;
    for(i=1;i<=n;i++)in>>a[i];
    for(i=1;i<=m;i++)in>>b[i];
    //if(n<m)swap(n,m);
    for(i=1;i<=m;i++)
    {
        for(j=1;j<=n;j++)
        {
            if(b[i]==a[j])
                v[i][j]=v[i-1][j-1]+1;
            else
            {
                v[i][j]=max(v[i-1][j],v[i][j-1]);
            }
            if(v[i][j]>ma)ma=v[i][j];
        }
    }
    i=m;j=n;ok=1;
    while(i!=0)
    {
        if(b[i]==a[j])
        {
            k++;
            c[k]=b[i];
            i--; j--;
        }
        if(ok==1)
        {
            y=v[i][j];
            while(v[i][j]==y)
                if(v[i][j-1]==y)j--;
                else break;
            ok=0;
            //cout<<j<<endl;
        }
        else
        {
            y=v[i][j];
            while(v[i][j]==y)
                if(v[i-1][j]==y)i--;
                else break;
            ok=1;
        }
    }
    /*for(i=1;i<=m;i++)
    {
        for(j=1;j<=n;j++);
            cout<<v[i][j]<<" ";
       cout<<endl;
    }*/
    out<<ma<<endl;
    for(i=k;i>=1;i--)out<<c[i]<<" ";
    return 0;
}