Cod sursa(job #1789617)

Utilizator tuddor1234Turdasan Tudor tuddor1234 Data 27 octombrie 2016 11:40:51
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n,m,i,j;
short MAP[1025][1025];
short v1[1026],v2[1026];
short v3[1026];
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++) fin>>v1[i];
    for(j=1;j<=m;j++) fin>>v2[j];

    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            if(v1[i]==v2[j]) MAP[i][j]=MAP[i-1][j-1]+1;
                else MAP[i][j]=max(MAP[i-1][j],MAP[i][j-1]);

    cout<<MAP[n][m]<<"\n";
    int x=MAP[n][m];
    i=n;j=m;
    while(x!=0)
    {
        while(MAP[i][j]==MAP[i-1][j]) i--;
        while(MAP[i][j]==MAP[i][j-1]) j--;
         v3[x]=v1[i];
         i--;j--;
         x--;
    }
    for(i=1;i<=MAP[n][m];i++) cout<<v3[i]<<" ";


    return 0;
}