算法导论 4.1-5 最大子数组问题 线性时间算法 C++简单实现

#include <iostream>
int subarray(int a[], int left, int right)
{
int sum = INT_MIN;
int temp = 0;
for (int i = left; i <= right; i++)
{
temp += a[i];
if (temp > sum)
{
sum = temp;
}
if (temp < 0)
temp = 0;
}
return sum;
}

int main()
{
int a[] = { 0,-1,1,1,-6,-7 };
std::cout << subarray(a, 0, 5)<<'\n';
return 0;
}