程序员算法之求最大子数组的和

#include <stdio.h>

int main()
{
    int subsum = 0;
    int great = 0; 
    int a[8] = {1,-2,3,10,-4,7,2,-5};
    for(int i = 0;i < 8;i++)
    {
        subsum = subsum + a[i];
        if(subsum < 0) subsum = 0;
        if(subsum > great)
        {
            great = subsum;
        }
    }
    
    printf("%d\n",great);
    return 0;
}