Cod sursa(job #2287696)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 22 noiembrie 2018 12:45:12
Problema Cel mai lung subsir comun Scor 0
Compilator c-64 Status done
Runda Arhiva educationala Marime 0.54 kb
#include<fstream>
#define N 1025
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int v[N],s[N][N],i,j,n,m,x[N],y[N];
int main() {
    f>>n>>m;
    for(i=1;i<=n;i++)
        f>>x[i];
    for(i=1;i<=m;i++)
        f>>y[i];
    for(i=1;i<=n;i++)
    for(j=1;j<=m;j++)
        s[i][j]=(x[i]==y[j]?1+s[i-1][j-1]:max(s[i-1][j],s[i][j-1]))
    for(;n;)
        if(x[n]==y[m])
            v[++v[0]]=x[n],n--,m--;
        else
            s[n-1][m]<s[n][m-1]?m--:n--;
    g<<t[0]<<'\n'
    for(i=t[0];i;i--)
        g<<t[i]<<" ";
}