求子数组的最大和

#include<stdio.h>
int main()
{
    int a[100];
    int dp[100];
    int n,start,end,max;
    while(scanf("%d",&n)==1)
    {
        int i;
        for(i=0;i<n;i++)
            scanf("%d",&a[i]);
        max = 0;
        dp[0] = a[0];
        for(i=1;i<n;i++)
        {
            if(dp[i-1]>0)
                dp[i] = dp[i-1]+a[i];
            else
                dp[i] = a[i];
            if(dp[i]>max)
            {
                max = dp[i];
                if(dp[i] == a[i])
                {
                    start = i;
                    end = i;
                }
                else
                {
                    end = i;
                }
            }
        }
        printf("max=%d,start=%d,end=%d",max,start,end);
    }
}