Cod sursa(job #2374344)

Utilizator toadehuPuscasu Razvan Stefan toadehu Data 7 martie 2019 18:06:43
Problema Cel mai lung subsir comun Scor 40
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.11 kb
#include <bits/stdc++.h>

using namespace std;

int m, n, v1[1111], v2[1111], din[1111][1111], sir[1111], ans;

int main()
{
    ifstream fin ("cmlsc.in");
    ofstream fout ("cmlsc.out");
    fin>>n>>m;
    for (int i=1; i<=n; ++i)
    {
        fin>>v1[i];
    }
    for (int i=1; i<=m; ++i)
    {
        fin>>v2[i];
    }
    for (int i=1; i<=n; ++i)
    {
        for (int j=1; j<=m; ++j)
        {
            if (v1[i]==v2[j])
            {
                din[i][j]=1+din[i-1][j-1];
            }
            else
            {
                din[i][j]=max(din[i-1][j], din[i][j-1]);
            }
        }
    }

    for (int i=m,j=n; i;)
    {
        if (v1[i]==v2[j])
        {
            sir[++ans]=v1[i];
            --i;
            --j;
        }
        else
        {
            if (din[i-1][j] < din[i][j-1])
            {
                --j;
            }
            else
            {
                --i;
            }
        }
    }
    fout<<ans<<"\n";;
    for (int i=ans; i>=1; --i)
    {
        fout<<sir[i]<<" ";
    }
    return 0;
}