Cod sursa(job #1168665)

Utilizator costyrazvyTudor Costin Razvan costyrazvy Data 9 aprilie 2014 11:10:12
Problema Cel mai lung subsir comun Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.58 kb
#include <fstream>
#define fr(i,x) for (i=1;i<=x;i++)
#define mx(a, b) ((a > b) ? a : b)
#define NMAX 1030
using namespace std;
int n,m,a[NMAX],b[NMAX],i,j,T[NMAX][NMAX];
int main()
{
    ifstream f("cmlsc.in");
    ofstream g("cmlsc.out");
    f>>n>>m;
    fr(i,n) f>>a[i];
    fr(i,m) f>>b[i];
    fr(i,n) fr(j,m)
          if (a[i]==b[j]) T[i][j]=mx(T[i-1][j],T[i][j-1])+1;
             else T[i][j]=mx(T[i-1][j],T[i][j-1]);
    g<<T[n][m]<<'\n';
    fr(i,n) fr(j,m)
    if (T[i][j]==mx(T[i-1][j],T[i][j-1])+1) g<<a[i]<<" ";
    f.close();
    g.close();
    return 0;
}