Cod sursa(job #2107078)

Utilizator LXGALXGA a LXGA Data 16 ianuarie 2018 18:50:38
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
vector<int> abc;
int v1[1025],v2[1025];
int dp[1025][1025];
int main()
{
    int n,m,i,j;
    cin>>n>>m;
    for(i=1;i<=n;i++)
    {
        cin>>v1[i];
    }
    for(i=1;i<=m;i++)
    {
        cin>>v2[i];
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            dp[i][j]=max(dp[i][j-1],dp[i-1][j]);
            if(v1[i]==v2[j])
                dp[i][j]=max(dp[i][j],dp[i-1][j-1]+1);
        }
    }
    cout<<dp[n][m]<<"\n";
    int x=n,y=m;
    while(x>=1 && y>=1)
    {
        if(dp[x][y]==dp[x][y-1])
            y--;
        else
            if(dp[x][y]==dp[x-1][y])
                x--;
            else
                {abc.push_back(v1[x]);x--;y--;}
    }
    for(i=abc.size()-1;i>=0;i--)
        cout<<abc[i]<<" ";
    return 0;
}