求子数组的最大和(数组)

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

int findGreatsubsum(const int *a, const int size){

    int cursum = 0;
    int maxnsum = -99999999;
    for(int i = 0; i < size; i++){

        cursum += a[i];
        if(cursum > maxnsum){

            maxnsum = cursum;
        }
        if(cursum <= 0){

            cursum = 0;
        }
    }
    return maxnsum;
}

int main()
{
   int a[] = {0, -3, -5, -3, -4, -17};
   printf("%d\n", findGreatsubsum(a, 6));


    return 0;
}

猜你喜欢

转载自blog.csdn.net/qqchenjunwei/article/details/45027917