Cod sursa(job #1026300)

Utilizator DenisacheDenis Ehorovici Denisache Data 11 noiembrie 2013 14:43:51
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.08 kb
#include <stdio.h>
using namespace std;
FILE * f=fopen("cmlsc.in","r");
FILE * g=fopen("cmlsc.out","w");
int n,m,v1[1025],v2[1025],i,j,a[1025][1025],v[1025],l;
int maxi(int a,int b)
{
    int maxi;
    if (a>=b) maxi=a;
    else maxi=b;
    return maxi;
}
int main()
{
    fscanf(f,"%d%d",&n,&m);
    for (i=1;i<=n;i++)
       fscanf(f,"%d",&v1[i]);
    for (i=1;i<=m;i++)
       fscanf(f,"%d",&v2[i]);
    for (i=1;i<=n;i++)
    {
        for (j=1;j<=m;j++)
        {
            if (v1[i]==v2[j])
            {
                a[i][j]=a[i-1][j-1]+1;
            }
            else
            {
                a[i][j]=maxi(a[i-1][j],a[i][j-1]);
            }
        }
    }
    fprintf(g,"%d\n",a[n][m]);
    i=n; j=m;
    while (a[i][j]!=0)
    {
        if (v1[i]==v2[j])
        {
            l++;
            v[l]=v1[i];
            i--; j--;
        }
        else
        {
            if (a[i-1][j]>=a[i][j-1]) i--;
            else j--;
        }
    }
    for (i=l;i>0;i--)
    {
        fprintf(g,"%d ",v[i]);
    }
    return 0;
}