本文小编为大家详细介绍“怎么使用C++动态规划计算最大子数组”，内容详细，步骤清晰，细节处理妥当，希望这篇“怎么使用C++动态规划计算最大子数组”文章能帮助大家解决疑惑，下面跟着小编的思路慢慢深入，一起来学习新知识吧。
题目：输入一个整形数组，数组里有正数也有负数。数组中连续的一个或多个整数组成一个子数组，每个子数组都有一个和。求所有子数组的和的最大值。要求时间复杂度为O(n)。
例如输入的数组为1, -2, 3, 10, -4, 7, 2, -5，和最大的子数组为3, 10, -4, 7, 2，因此输出为该子数组的和18。
代码【C++】
计算
安全
数据库
网络和加速
企业服务
#include <iostream>
using namespace std;
/
// Find the greatest sum of all sub-arrays
// Return value: if the input is valid, return true, otherwise return false
/
bool FindGreatestSumOfSubArray
(
int *pData, // an array
unsigned int nLength, // the length of array
int &nGreatestSum // the greatest sum of all sub-arrays
)
{
// if the input is invalid, return false
if((pData == NULL) || (nLength == 0))
return false;
int nCurSum = nGreatestSum = 0;
for(unsigned int i = 0; i < nLength; ++i)
{
nCurSum += pData[i];
// if the current sum is negative, discard it
if(nCurSum < 0)
nCurSum = 0;
// if a greater sum is found, update the greatest sum
if(nCurSum > nGreatestSum)
nGreatestSum = nCurSum;
}
// if all data are negative, find the greatest element in the array
if(nGreatestSum == 0)
{
nGreatestSum = pData[0];
for(unsigned int i = 1; i < nLength; ++i)
{
if(pData[i] > nGreatestSum)
nGreatestSum = pData[i];
}
}
return true;
}
int main()
{
int arr[] = {1, -2, 3, 10, -4, 7, 2, -5};
int iGreatestSum;
FindGreatestSumOfSubArray(arr, sizeof(arr)/sizeof(int), iGreatestSum);
cout << iGreatestSum << endl;
return 0;
}结果
代码【C++】
#include <iostream>
using namespace std;
/
// Find the greatest sum of all sub-arrays
// Return value: if the input is valid, return true, otherwise return false
/
bool FindGreatestSumOfSubArray
(
int *pData, // an array
unsigned int nLength, // the length of array
int &nGreatestSum, // the greatest sum of all sub-arrays
int &start, // Added
int &end // Added
)
{
// if the input is invalid, return false
if((pData == NULL) || (nLength == 0))
return false;
int nCurSum = nGreatestSum = 0;
int curStart = 0, curEnd = 0; // Added
start = end = 0; // Added
for(unsigned int i = 0; i < nLength; ++i)
{
nCurSum += pData[i];
curEnd = i; // Added
// if the current sum is negative, discard it
if(nCurSum < 0)
{
nCurSum = 0;
curStart = curEnd = i + 1; // Added
}
// if a greater sum is found, update the greatest sum
if(nCurSum > nGreatestSum)
{
nGreatestSum = nCurSum;
start = curStart; // Added
end = curEnd; // Added
}
}
// if all data are negative, find the greatest element in the array
if(nGreatestSum == 0)
{
nGreatestSum = pData[0];
start = end = 0; // Added
for(unsigned int i = 1; i < nLength; ++i)
{
if(pData[i] > nGreatestSum)
{
nGreatestSum = pData[i];
start = end = i; // Added
}
}
}
return true;
}
int main()
{
int arr[] = {1, -2, 3, 10, -4, 7, 2, -5};
int iGreatestSum, start, end;
FindGreatestSumOfSubArray(arr, sizeof(arr)/sizeof(int), iGreatestSum,
start, end);
cout << iGreatestSum << ": ";
for(int i = start; i <= end; i++)
{
cout << arr[i] << " ";
}
return 0;
}结果
读到这里，这篇“怎么使用C++动态规划计算最大子数组”文章已经介绍完毕，想要掌握这篇文章的知识点还需要大家自己动手实践使用过才能领会，如果想了解更多相关内容的文章，欢迎关注亿速云行业资讯频道。
亿速云「云服务器」，即开即用、新一代英特尔至强铂金CPU、三副本存储NVMe SSD云盘，价格低至29元/月。点击查看>>
免责声明：本站发布的内容（图片、视频和文字）以原创、转载和分享为主，文章观点不代表本网站立场，如果涉及侵权请联系站长邮箱：is@yisu.com进行举报，并提供相关证据，一经查实，将立刻删除涉嫌侵权内容。
