#include "stdafx.h"
#include<string>
using namespace std;
void FinSum(int A[],int len)
{
int Subsum = A[0];
int Subsum2 = 0;
for (int i = 0; i < len; i++)
{
if (Subsum2>0)
Subsum2 += A[i];
else
{
Subsum2 = A[i];
}
if (Subsum2 > Subsum)
Subsum = Subsum2;
}
printf("Subsum=%d", Subsum);
}
int main()
{
int A[] = { -10, 1 ,2 ,3, 4, - 5, - 23, 3, 7, - 21 };
int len_ = 10;
FinSum(A, len_);
return 0;
}
最大连续子序列和问题O(N)复杂度
最新推荐文章于 2022-12-27 16:22:02 发布