hdoj1003，很多测试用例都通过了，但还是提示wa，求大神指导一下

[SL_SL_]

#include"stdio.h"
main()
{
int cases , amount , i , p , q , temp1 , temp2 , max_temp , a[100000] ;
int max , start , end ;
scanf("%d" , &cases) ;
if(cases < 1 || cases > 20)
return ;
for(temp1 = 0 ; temp1 < cases ; temp1++)
{
scanf("%d" , &amount) ;

for(temp2 = 0 ; temp2 < amount ; temp2++)
scanf("%d" , a + temp2) ;

max = a[0] ;
p = 1 ;
q = 1 ;
start = 1 ;
end = 1 ;

for(i = 0 , max_temp = 0 ; i < amount ; i++)
{
max_temp += a[i] ;
q = i + 1 ;
if(max_temp > max)
{
max = max_temp ;
start = p ;
end = q ;
}
else if(max_temp < 0)
{
max_temp = 0 ;
p = i + 2 ;
q = i + 2 ;
}
}


printf("Case %d:\n%d %d %d\n" , temp1 + 1 , max , start , end) ;
if(temp1 < cases - 1)
printf("\n") ;
}
}

[mxway]

看下面这组测试。

[mxway]

这是你的程序输出结果，正确结果应该是-1。

[南边风景好]

之前做过，贴下代码，a是数组，len是数组长度

void max_sum(int *a, long len)
{
    long i,p = 0;
    int curSum = 0; 
    int maxSum = -1000; 
    long start = 0,end = 0;

    for(i = 0;i < len;i++)
    {
        if(curSum < 0)
        {
            curSum = *(a+i);
            p = i ;
        }
        else
            curSum += *(a+i);
        if(curSum > maxSum )
        {
            maxSum = curSum;
            start = p;
            end = i;
        }
    }
    printf("%d %ld %ld",maxSum,start+1,end+1);

}

[logiciel]

如下修改可AC:

#include"stdio.h"
int main() //改 main()
{
  int cases , amount , i , p , q , temp1 , temp2 , max_temp , a[100000] ;
  int max , start , end ;
  scanf("%d" , &cases) ;
  if(cases < 1 || cases > 20)
    return ;
  for(temp1 = 0 ; temp1 < cases ; temp1++)
  {
    scanf("%d" , &amount) ;

    for(temp2 = 0 ; temp2 < amount ; temp2++)
      scanf("%d" , a + temp2) ;

    max = a[0] ;
    p = 1 ;
    q = 1 ;
    start = 1 ;
    end = 1 ;

    for(i = 1 , max_temp = a[0] ; i < amount ; i++) //改 for(i = 0 , max_temp = 0 ; i < amount ; i++)
    {
      max_temp += a[i] ;
      q = i + 1 ;
      if(max_temp < a[i]) //加
      {
        max_temp = a[i] ; //加
        p = i + 1;        //加
      }
      if(max_temp > max)
      {
        max = max_temp ;
        start = p ;
        end = q ;
      }
      /*删
      else if(max_temp < 0)
      {
        max_temp = 0 ;
        p = i + 2 ;
        q = i + 2 ;
      }*/
    }


    printf("Case %d:\n%d %d %d\n" , temp1 + 1 , max , start , end) ;
    if(temp1 < cases - 1)
      printf("\n") ;
  }

  return 0; //加
}