C DP LIS(Longest increasing Sub sequence)

#include<stdio.h>
int l[11],a[11],par[11],seq[11];

int parent(int n)
{
   int x;
   if(n!=0) return 0;
   seq[n] = parent(n);
   return seq[n];
}


int main()
{
    int j,i;

    a[1] = 9;
    a[2] = 2;
    a[3] = 5;
    a[4] = 3;
    a[5] = 7;
    a[6] = 11;
    a[7] = 8;
    a[8] = 10;
    a[9] = 13;
    a[10] = 6;

    l[0] = 0;

    for(i=1;i<11;i++)
    {
        for(j=0;j<i;j++)
        {
            if(a[j] < a[i])
            {
                l[i] = 1 + l[j];
                par[i] = j;
                seq[i] = a[i-1];
            }
         }
    }

    printf("Array:    ");
     for(i=1;i<11;i++)
        printf("%d\t",a[i]);

    printf("\nLength:   ");
     for(i=1;i<11;i++)
        printf("%d\t",l[i]);

     printf("\nParents:  ");
     for(i=1;i<11;i++)
        printf("%d\t",par[i]);

     printf("\nSequence: ");
      for(i=5;i>=1;i--)
           printf("%d\t",seq[i]);




    return 0;
}