Cod sursa(job #2967230)

Utilizator PuskaPalfi Viktoria Tunde Puska Data 19 ianuarie 2023 10:47:01
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.9 kb
#include <iostream>
#include <fstream>

using namespace std;

int a[2000][2000];

int main()
{
    int n, m;
    ifstream f("grader_test1.in");
    ofstream g("grader_test1.out");
    f>>n>>m;
    n+=2; m+=2;
    for(int i=3; i<=n; i++) f>>a[i][1];
    for(int i=3; i<=m; i++) f>>a[1][i];

    for(int i=3; i<=n; i++){
        for(int j=3; j<=m; j++){
            if(a[i][1]==a[1][j]){
                a[i][j]=a[i-1][j-1]+1;
            }
            else{
                a[i][j]=max(a[i-1][j], a[i][j-1]);
            }
        }
    }

    int i=n, j=m, v[a[n][m]+1], p=1;
    while(i>=3 && j>=3){
        if(a[1][j]==a[i][1]){
            v[p++]=a[1][j];
            i--; j--;
        }
        else{
            if(a[i-1][j]>a[i][j-1]) i--;
            else j--;
        }
    }
    g<<a[n][m]<<endl;
    for(int i=p-1; i>=1; i--) g<<v[i]<<" ";
    g.close();
    return 0;
}