#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;
}
求子数组的最大和(数组)
最新推荐文章于 2020-03-29 18:46:33 发布