Cod sursa(job #1828744)

Utilizator cicero23catalin viorel cicero23 Data 13 decembrie 2016 20:31:56
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int n,m,i,j,q[1026][1026],a[1026],b[1026],v[10000000];
int main()
{
    f>>m>>n;
    for(i=1;i<=m;i++)
    f>>a[i];
    for(j=1;j<=n;j++)
        f>>b[i];
    for(i=1;i<=m;i++)
        for(j=1;j<=n;j++)
          if(a[i]==b[j]) q[i][j]=q[i-1][j-1];
           else q[i][j]=max(q[i-1][j],q[i][j-1]);
    i=m;
    j=n;
    while(i>=1&&j>=1)
    {
        if(a[i]==b[j]){v[q[i][j]]=a[i]; i--;j--;}
        else if(q[i-1][j]>q[i][j-1]) i--;
        else j--;
    }
    g<<q[n][m]<<'\n';
      for(i=1;i<=q[n][m];i++) g<<v[i]<<" ";
    return 0;
}