Cod sursa(job #3313897)

Utilizator amalia_ghicaAmalia Ghica amalia_ghica Data 7 octombrie 2025 11:09:50
Problema Cel mai lung subsir comun Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.92 kb
#include <fstream>

using namespace std;
int v[1030], u[1030], dp[1030][1030];
int main()
{
    ifstream cin("cmlsc.in");
    ofstream cout("cmlsc.out");
    int n, m, k;
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> v[i];
    }
    for(int i = 1; i <= m; i++){
        cin >> u[i];
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(v[i] == u[j]){
                dp[i][j] = 1 + dp[i - 1][j - 1];
            }else{
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
            }
        }
    }
    cout << dp[n][m] << "\n";
    k = 1;
    for(int i = 1; i <= n  &&  k <= dp[n][m]; i++){
        for(int j = 1; j <= m  &&  k <= dp[n][m]; j++){
            if(dp[i][j] == dp[i - 1][j - 1] + 1  &&  v[i] == u[j]  &&  dp[i][j] == k){
                cout << v[i] << " ";
                k++;
            }
        }
    }
    return 0;
}