#include<stdio.h>
int a[20][100005];
int main()
{
    int T,i,j=0,x[20],y[20],p=0,sum=0,summax[20];
    int N[20];
    scanf("%d",&T);
    for(j=0;j<T;j++)
    { sum=0;
    scanf("%d",&N[j]);
    for(i=0;i<N[j];i++)
        scanf("%d",&a[j][i]);
        summax[j]=a[j][0];
        x[j]=0;y[j]=0;
    for(i=0;i<N[j];i++)
    {    sum=sum+a[j][i];
        if(sum>summax[j])
           {  summax[j]=sum;
             x[j]=p;y[j]=i;
           }
          if(sum<0)
           {  sum=0;
              p=i+1;
           }
     }
    }
     for(i=0;i<T;i++)
    {printf("Case %d:\n",i+1);
    printf("%d %d %d",summax[i],x[i]+1,y[i]+1);
     if(i!=T-1)
    printf("\n\n");
     }
     return 0;
  }

很忙，仔细看！二维数组可定义的真够长的

它题目要这么长，我也不知道咋办(・o・)。

问一句wa是啥

我用DEVC跑了一遍代码，没有语法上的错误

首先要贴题目要求，不要让别人浪费时间去网上找：http://acm.hdu.

#include <stdio.h>

int main( void )
{
    unsigned T;
    scanf( "%u", &T );
    for( unsigned t=0; t!=T; ++t )
    {
        int maxsum = -1000;
        unsigned maxsum_l=0, maxsum_r=0;

        int sum = 0;
        unsigned sum_l=0;

        unsigned N;
        scanf( "%u", &N );
        for( unsigned i=0; i!=N; ++i )
        {
            int a;
            scanf( "%d", &a );
            sum += a;

            if( sum > maxsum )
            {
                maxsum = sum;
                maxsum_l = sum_l;
                maxsum_r = i;
            }

            if( sum < 0 )
            {
                sum = 0;
                sum_l = i+1;
            }
        }

        printf( "Case %u:\n%d %u %u%s", t+1, maxsum, maxsum_l+1, maxsum_r+1, "\n\n"+(t+1==T) );
    }
}

wrong answer

哦哦