/* Note:Your choice is C IDE */
#include "stdio.h"
void main()
{
    int a[100]={0};
    int b[100]={0};
    int h,k;
    int i,sum,m,n,p=0;
    scanf("%d",&h);
    while(h--)
    {
        p++;
        scanf("%d",&m);
        for(i=0;i<m;i++)
        {
            scanf("%d",&a[i]);
        }
        for(i=0;i<m;i++)
        {
            if(a[i]>=0)
            {
                k=i;
                break;
            }
        }
        
        for(i=k;i<m;i++)
        {
            if(i==k)
            {
                b[i]=a[i];
            }
            else
            {
                b[i]=b[i-1]+a[i];
            }
        }
        for(i=k;i<m;i++)
        {
            if(b[i]>b[i-1])
            {
                sum=b[i];
                n=i+1;
            }
            else
            {
                sum=b[i-1];
                n=i;
            }
        }
        printf("case%d:\n",p);
        printf("%d  %d  %d\n\n",sum,k,n);
    }
   
}

[ 本帖最后由 竹闲云 于 2012-8-20 13:54 编辑 ]

这题已经郁闷我好久了，怎么看就是个简单的最大子段和问题，但就是搞不定。

你看看我这个程序，为什么提示说运行出错呢
#include "stdio.h"
void main()
{
    int a[100]={0};
    int b[100]={0};
    int zs,gs,ks,js,cs,sum,i,t=0;
    scanf("%d",&zs);
    while(zs--)
    {
        t++;
        scanf("%d",&gs);
        for(i=0;i<gs;i++)
        {
            scanf("%d",&a[i]);
        }
        for(i=0;i<gs;i++)
        {
            if(a[i]<0)
            {
                cs=0;
            }
            else
            {
                cs=1;
                ks=i;
                break;
            }
        }
        if(cs==0)
        {
            for(i=0;i<gs;i++)
            {
                if(i==0)
                {
                    sum=a[0];
                    ks=0;
                    js=0;
                }
                else
                {
                    if(sum<a[i])
                    {
                        sum=a[i];
                        ks=i;
                        js=i;
                    }
                }
            }
        }   
        else
        {
            for(i=ks;i<gs;i++)
            {
                if(i==ks)
                {
                    b[ks]=a[ks];
                }
                else
                {
                    b[i]=b[i-1]+a[i];
                }
            }
            for(i=ks;i<gs;i++)
            {
                if(i==ks)
                {
                    sum=b[i];
                    js=i;
                }
                else
                {
                    if(sum<b[i])
                    {
                        sum=b[i];
                        js=i;
                    }
                }
            }
        }
        printf("case%d:\n",t);
        printf("%d %d %d\n\n",sum,ks+1,js+1);
    }   
}

没错啊。

数组开的太小，溢出了。

杨大哥说搞不定，我马上兴趣就来了

回去试试

呵呵，好啊，搞定了一定要告诉我，也了却我一个心结。

输出的case首字母要大写，写成“Case”
#include <iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
    for(int x=0;x<t;x++)
    {
        int n;
        cin>>n;
        int *sum=new int[n]();
        int a,max;
        cin>>a;
        sum[0]=max=a;
        int from=1,to=1;
        int start=1,end=1;
        for(int i=1;i<n;i++)
        {
            cin>>a;
            sum[i]=a;
            if(sum[i]<=a+sum[i-1])
            {
                sum[i]+=sum[i-1];
                end=i+1;
            }
            else
            start=end=i+1;
            if(max<=sum[i])
            {
                max=sum[i];
                from=start,to=end;
            }
        }
        cout<<"Case "<<x+1<<':'<<endl;
        cout<<max<<' '<<from<<' '<<to<<endl;
        if(x<t-1) cout<<endl;
    }
}

表示这个程序的结果和自己笔算的结果一样，个人认为没错啊！

表示我当初也试过各种数据，表示都正确，但提交到OJ就是WA。表示很无奈。