Cod sursa(job #1333951)

Utilizator turbowin120Amarandei-Stanescu Alexandru turbowin120 Data 3 februarie 2015 19:30:35
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.1 kb
#include <iostream>
#include <stdio.h>
using namespace std;
const int N=1069;
int drum[N][N],v[N],n,m,a[N],b[N];

inline int  maxim(int x, int y){ if(x>y) return x; return y;}

void citire(){
    FILE * in;
    in=fopen("cmlsc.in","r");
    fscanf(in,"%d%d",&n,&m);

    for(int i=1;i<=n;i++)
        fscanf(in,"%d",&a[i]);

    for(int i=1;i<=m;i++)
        fscanf(in,"%d",&b[i]);

}

void rez(){

    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if(a[i]==b[j]) drum[i][j]=1+drum[i-1][j-1];
            else drum[i][j]=maxim(drum[i-1][j],drum[i][j-1]);




}

void afisare(){
    FILE *out;
    out=fopen("cmlsc.out","w");
    int lung=0;
    for(int i=n,j=m;i;){
        if(a[i]==b[j]) {
                lung++;
                v[lung]=a[i];
                i--;
                j--;
        }
        else if(drum[i-1][j]<drum[i][j-1]) j--;
            else i--;
    }
    fprintf(out,"%d\n",lung);
    for(int i=lung;i>=1;i--){
        fprintf(out,"%d ",v[i]);
    }
}

int main()
{
    citire();
    rez();
    afisare();
    return 0;
}