Cod sursa(job #2449171)

Utilizator bogdanmicamica bogdan bogdanmica Data 18 august 2019 14:26:38
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <iostream>
#include<fstream>
#include<vector>
using namespace std;
#define nmax 1024

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

int sir1[nmax],sir2[nmax];
int exista[256];
int n,m;
int matrice[nmax][nmax];

int main()
{int i,j;
f>>n>>m;
for(i=1;i<=n;i++)
    f>>sir1[i];
for(i=1;i<=m;i++)
    f>>sir2[i];
for(i=1;i<=m;i++)
    matrice[0][i]=0;
for(i=1;i<=n;i++)
    matrice[i][0]=0;

    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        {if(sir1[i]!=sir2[j])
        matrice[i][j]=max(matrice[i][j-1],matrice[i-1][j]);
    else matrice[i][j]=1+max(matrice[i][j-1],matrice[i-1][j]);
         if(sir1[i]==sir2[j])
            exista[sir1[i]]=1;
        }
        int nr=0;
g<<matrice[n][m]<<endl;
for(i=1;i<=256;i++)
if(exista[i] && nr<matrice[n][m])
{g<<i<<" ";
 nr++;
}
    return 0;
}