Cod sursa(job #1717487)

Utilizator martynassAlex Martinas martynass Data 14 iunie 2016 22:31:32
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <iostream>
#include <string>
#include<stdlib.h>
#include<fstream>
using namespace std;

int max(int a,int b)
{
    if(a>b)
        return a;
    else return b;
}

int a[300][300];
int main()
{
    ifstream f("cmlsc.in");
    ofstream g("cmlsc.out");
    int n,m,v1[300],v2[300],nr=0,k=0,v[300];
    f>>n>>m;
    for(int i=1;i<=n;i++)
        f>>v1[i];
    for(int j=1;j<=m;j++)
        f>>v2[j];
   for(int i=1;i<=m;i++)
       for(int j=1;j<=n;j++)
           {if(v2[i]==v1[j])
               a[i][j]=1+a[i-1][j-1];
           else a[i][j]=max(a[i][j-1],a[i-1][j-1]);
           if(a[i][j]>nr)
               {
                   v[++k]=v2[i];
                   nr++;
               }
                }
  g<<nr<<endl;
       for(int i=1;i<=k;i++)
        g<<v[i]<<' ';
f.close();
g.close();
return 0;
}