Cod sursa(job #2237767)

Utilizator radu.leonardoThe Doctor radu.leonardo Data 3 septembrie 2018 00:18:53
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");

int n,m,best;
vector<int> a(1025),b(1025),v(1025);
vector<vector<int>> dp(1025,vector<int>(1025));

int main() {

    fin>>n>>m;
    for(int i=1; i<=n; i++)
        fin>>a[i];

    for(int i=1; i<=m; i++)
        fin>>b[i];

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

    for (int i=n, j=m; i;)
        if (a[i] == b[j])
            v[++best]=a[i],i--,j--;
        else if (dp[i-1][j] < dp[i][j-1])
            j--;
        else
            i--;

    fout<<best<<'\n';
    for(int i=best;i>=1;i--)
        fout<<v[i]<<' ';

    return 0;
}