c_cpp 【动态规划】最大子段和【】3.4

Posted 2021-05-14

//3d4-1 最大子段和问题的动态规划算法
#include "stdafx.h"
#include <iostream> 
using namespace std; 
 
int MaxSum(int n,int *a);
 
int main()
{
	int a[] = {-2,11,-4,13,-5,-2};
 
	for(int i=0; i<6; i++)
	{
		cout<<a[i]<<" ";
	}
 
	cout<<endl;
	cout<<"数组a的最大连续子段和为:"<<MaxSum(6,a)<<endl;
 
	return 0;
}
 
int MaxSum(int n,int *a)
{
	int sum=0,b=0;
	for(int i=1; i<=n; i++)
	{
		if(b>0)
		{
			b+=a[i];
		}
		else
		{
			b=a[i];
		}
		if(b>sum)
		{
			sum = b;
		}
	}
	return sum;
}