Cod sursa(job #1048065)

Utilizator bogdan9183Bogdan Cionca bogdan9183 Data 5 decembrie 2013 11:14:24
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include <fstream>
using namespace std;

short m,n, a[1025], b[1025], c[1025][1025],d;

int main()
{   ifstream f("cmlsc.in");
    ofstream g("cmlsc.out");
    int i;
    f>>m>>n;
    for (i=1;i<=m;i++)
    f>>a[i];
    for (i=1;i<=n;i++)
    f>>b[i];
    c[0][0]=0;
    for (int i=1;i<=m;i++)
    for (int j=1;j<=n;j++)
    if (a[i]==b[j])
    c[i]=c[i-1][j-1]+1;
    else c[i]=max(c[i=1][j],c[i][j-1]);

    while(i>0 && j>0)
    {  if(a[i]==b[j])
        {   d[++k]=a[i];
            i--;
            j--;
        }
        else
        {   if(c[i-1][j]<c[i][j-1])
            j--;
            else
            i--;
        }
    }
   for(i=k;i>=1;i--)
   g<<d[i]<<" ";


}