Solution to Maximum Subarray in linear-time algorithm with time complexity is O(n)

最新推荐文章于 2023-02-25 22:41:55 发布

原创最新推荐文章于 2023-02-25 22:41:55 发布 · 445 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #subarray #On

C++ 专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种通过改变初始值来寻找最大子数组和的高效算法。该算法使用C++实现，能够在数组元素总和小于零的情况下找到最大的连续子数组和。通过具体示例展示了算法的具体应用。

<span style="font-family: Arial, Helvetica, sans-serif; background-color: rgb(255, 255, 255);">This algorithm realises the searching method for maximum subarray by changing the initial value when the sum is below 0.</span>

<span style="font-family: Arial, Helvetica, sans-serif; background-color: rgb(255, 255, 255);">The C++ code shows as follow:</span>

<span style="font-family: Arial, Helvetica, sans-serif; background-color: rgb(255, 255, 255);">
</span>

<span style="font-family: Arial, Helvetica, sans-serif; background-color: rgb(255, 255, 255);"></span><pre name="code" class="cpp">#include<iostream>
#include<vector>
using namespace std;

int MaxSum(vector<int>& a){
	int n=a.size();
	vector<int>::iterator it=a.begin();
	int max=*it;
	int sum=0;
	for(int cnt=0; cnt<n; cnt++){
		if(sum>0)
			sum += *it;
		else
			sum = *it;
		if(sum>max)
			max = sum;
		it++;
	}
	return max;
}

int main(){
	vector<int> vec;
	int a[]={-1,-2,-4,-10,-4,-7,-2,-5};
	vec.insert(vec.begin(),a,a+8);
	cout<<MaxSum(vec)<<endl;
	return 0;
}