Cod sursa(job #2581298)

Utilizator GarvanGrachiIvan Valentinov GarvanGrachi Data 14 martie 2020 20:50:22
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.87 kb
#include<bits/stdc++.h>
#include<fstream>
using namespace std;

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

int a[2048], b[2048], glo, res[2048], crr;
int bestTill[2048][2048];
vector<int> r;
int main(){
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int n, m;
    in>>n>>m;
    for(int i=0;i<n;++i){
        in>>a[i];
    }
    for(int i=0;i<m;++i)in>>b[i];
    for(int i=0;i<n;++i){
        for(int j=0;j<m;++j){
            if(a[i]==b[j]){glo = max (glo, bestTill[i][j] = 1+bestTill[i-1][j-1]);
            else bestTill[i][j] = max(bestTill[i-1][j], bestTill[i][j-1]);
        }
    }
    out<<glo<<'\n';
    for(int i=n-1, j=m-1; i>=0){
        if(a[i] == b[j]) res[c++]=a[i];
        else if(bestTill[i][j-1] > bestTill[i-1][j]) --j;
        else -- i;
    }
    for(int i=glo-1;i>-1; --i)out<<res[i]<<' ';
    return 0;
}