# include <stdio.h>
# include <string.h>
int MaxSum(int* arr, int size)
{
    int current = arr[0]; //当前数组最大和
    int max = current;

    for (int i = 0; i < size; i++)
    {
        if (current < 0)
            current = 0;
        current += arr[i];
        if (current > max)
            max = current;
    }
    return max;
}

int main(void)
{
    char x[40], y[40];

    int a1[5] = { -1, 5, 6, -7, 3 };
    int a2[5] = { -5, -4, -8, -1, -10 };
    int a3[5] = { -1, 5, 6, -7, 10 };

    int max1, max2, max3;
    max1 = MaxSum(a1, 5);
    max2 = MaxSum(a2, 5); //这个应该返回 -1， 
    max3 = MaxSum(a3, 5);
    printf("max1=%d,max2=%d,max3=%d\n",max1,max2,max3);
}

#include <stdio.h>
#include <stdlib.h>
void solution(int m, int *arr){
    int current=arr[0];
    int max=current;
    int start=0,end=0;
    int i=0;
    /*计算最大子数组之和*/
    for(i=1;i<m;i++)
    {
        if (current < 0)current = 0;   
        current += arr[i];
        if(current>max)
        {
            max = current;
            end=i;//最大子数组结束下标
        }
    }
    int temp=max;
    /*计算最大子数组结束下标*/
    for(i=end;i>=0;i--)
    {
      temp-=arr[i];
      if(temp<=0 || temp>max)break;
    }
    if(i<0)i=0;
    start=i;
    printf("%d,%d %d\n",max,start,end);
}
int main() {
    int n;
    printf("输入个数：");
    scanf("%d", &n);
    int *arr;
    arr = (int*)malloc(n * sizeof(int));
    printf("输入%d个整数:",n);
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &arr[i]);
    }
    solution(n, arr);
    return 0;
}