# include<stdio.h>
int main()
{
       int i,j,k,sum[30],l,z =0,num = 0,sub,len;
       int a[30],index[15][15],temp;
       sum[z] = 0;
       printf("\n Enter the Max.no. of elements to be 
entered in the array  :\n");
       scanf("%d",&len);
       printf("\n Enter the array Values : \n");
       for(i=0;i<len;i++)
       scanf("%d",&a[i]);
       for(i = 0;i <len;i++)
       {
           k = len/2;
           l = i+k;
           for(j=i;j<l;j++)
           if(j<len)
           {
               num++;
           }
           if(num == k)
           {
               for(j =i;j<l;j++)
               {
                 if(j<len)
                    sum[z] = sum[z]+a[j];
                else printf("\n num <3!");
               }
               z++;
               sum[z] = 0;
           }
           num = 0;
       }
       j = 0;
       for(i = 0 ;i <z;i++)
       {
          printf(" sum[%d] = %d\n",i,sum[i]);
          index[j][i] = sum[i];
       }
       for(i = 0;i<z;i++)
       {
           for(j = i+1;j<z;j++)
           if(sum[i] < sum[j])
           {
               temp = sum[i];
               sum[i] = sum[j];
               sum[j] = temp;
           }
     }
      j= 0;
      for(i = 0;i<z;i++)
      if(index[j][i] == sum[0])
      sub = i;
      printf(" Sub array of max. sum = { ");
      for(i = sub;i<sub+k;i++)
      printf(" %d  ",a[i]);
      printf("}");
  return 0;

}

Well this is not an answer to the question but the solution 
given in the example is wrong. Wont the subarray that gives 
the max sum be {9,4,3,-6,8,7,6,5} whose sum is 36???

Another approach

# include<stdio.h>

struct index { 
int sum;
int start;
int end;
};

int main()
{
	   struct index sumidx[30],*tmp;

       int i,j,z =0,len;
       int a[30];

       printf("\n Enter the Number of elements to be entered
in the array  :\n");
       scanf("%d",&len);

       printf("\n Enter the array Values : \n");
       for(i=0;i<len;i++)
       scanf("%d",&a[i]);

       for(i = 0;i <len - 1;i++)
       {
		   sumidx[z].sum = a[i];
		   sumidx[z].start = i;
		   sumidx[z].end = i;

		   for(j=i+1;j<len;j++)
			   if(sumidx[z].sum < (sumidx[z].sum + a[j]))
			   {
				   sumidx[z].sum = sumidx[z].sum + a[j];
				   sumidx[z].start = i;
				   sumidx[z].end = j;
			   }
			   else
				   break;

			z++;
	   }

	  tmp = sumidx;

      for(i = 0;i<z;i++)
	  {
		  if(sumidx[i].start != sumidx[i].end)
			  if(tmp->sum < sumidx[i].sum)
				tmp = sumidx+i;
	  }
      printf("\n sum = %d start = %d end
%d\n",tmp->sum,tmp->start,tmp->end);

	  return 0;

}