Cod sursa(job #1342264)

Utilizator SebiCarhatCarhat Eusebiu SebiCarhat Data 13 februarie 2015 18:37:34
Problema Cel mai lung subsir comun Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <fstream>

using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int a[1025],b[1025],v[1025][1025];
int max(int x,int y)
{
    if(x>y) return x;
    return y;
}
int main()
{
    int i,j,n,m,c[1025],k=0;
    f>>n>>m;
    for(i=1;i<=n;++i)
        f>>a[i];
    for(j=1;j<=m;++j)
        f>>b[j];
    for(i=1;i<=n;++i)
        for(j=1;j<=m;++j)
        if(a[i]==b[j])
            {
                v[i][j]=v[i-1][j-1]+1;
                k++;
                c[k]=a[i];
            }
    else v[i][j]=max(v[i][j-1],v[i-1][j]);
    g<<v[n][m]<<"\n";
    for(int l=1;l<=k;++l)
        g<<c[l]<<" ";
    return 0;
}