应用蛮力法求最大字段和问题

#include   "stdio.h"
#include   "stdlib.h" 
#include   "time.h"
int malifa(int sum);
void main()
{
   int summax=0;
   printf("\nsummax=%d\n\n",malifa(summax));
}
int malifa(int sum)
{
   int s=0;
   int i=0,j=0,k=0,n=0,m=0;
   int a[60]; 
   printf("请输序列长度："); 
   scanf("%d",&n);
   printf("\n请你输入序列："); 
   for(m=0;m<n;m++)
   {
        scanf("%d",&a[m]);
   }
   for(i=1;i<=n;i++)
   {
  for(j=1;j<=n+1-i;j++)
  {
  s=0;
  for(k=j-1;k<=j+i-2;k++)
  {
s=s+a[k];
if(s>sum)