Cod sursa(job #1998031)

Utilizator RaduPatraRadu Patra RaduPatra Data 6 iulie 2017 12:42:48
Problema Cel mai lung subsir comun Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 1.16 kb
#include <fstream>
#include <iostream>

using namespace std;

ifstream f("cmlsc.in");
ofstream g("cmlsc.out");

int a[1030][1030];
int v[1030],z[1030];


int main()
{
    int n,m,i,j,cnt=0,nr=0;
    f>>n;
    f>>m;

    for(i=1;i<=n;++i)
        f>>v[i];
    for(i=1;i<=m;++i)
        f>>z[i];

    for(i=1;i<=n;++i)
        {
        cnt=0;
        for(j=1;j<=m;++j)
            {
            if(v[i]==z[j])
                {
                cnt=a[i-1][j-1]+1;
                a[i][j]=cnt ;
                }
            else if(cnt<a[i-1][j])
                {
                cnt=a[i-1][j];
                a[i][j]=cnt;
                }
            else
                a[i][j]=cnt;
            }
        }

    g<<a[n][m]<<'\n';

    while(i>=1 && j>=1)
        {
        if(v[i]==z[j])
            {
            nr=nr*10+v[i];
            i--;
            j--;
            }
        else if(a[i-1][j]>a[i][j-1])
            i--;
        else if(a[i-1][j]<a[i][j-1])
            j--;
        else
            i--;
        }

    while(nr)
        {
        g<<nr%10<<" ";
        nr/=10;
        }

    return 0;
}