Cod sursa(job #3279022)

Utilizator Alex283810Mocan Alexandru Valnetin Alex283810 Data 21 februarie 2025 18:11:56
Problema Cel mai lung subsir comun Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.97 kb
#include <bits/stdc++.h>
std::ifstream fin("cmlsc.in");
std::ofstream fout("cmlsc.out");
int a[1025];
int b[1025];
int dp[1025][1025], n, m;
bool ap[257];
int sol[1025];
void afisare()
{
    for(int i = 1; i <= n; i++,fout <<'\n')
        for(int j = 1; j <= m ; j++)
            fout << dp[i][j] << ' ';
}
int main()
{
    int k = 0;
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> a[i];
    }
    for(int j = 1; j <= m; j++){
        fin >> b[j];
    }
    int maxi = 0;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++){
            dp[i][j] = std::max(dp[i - 1][j] * (i - 1 >= 1) , dp[i][j - 1] * (i - 1 >= 1) ) + (a[i] == b[j]);
            if(dp[i][j] > maxi && ap[a[i]] == 0)
            {
                maxi = dp[i][j];
                sol[++k] = a[i];
            }
            if(a[i] == b[j])ap[a[i]] = 1;
        }
    }
    fout << maxi << '\n';
    for(int i = 1; i <= k; i++)
    fout << sol[i] << ' ';
    //afisare();
    return 0;
}