求子数组最大和

清缕风

于 2015-08-06 17:22:39 发布

阅读量307

点赞数

分类专栏： c++

本文链接：https://blog.youkuaiyun.com/u012536286/article/details/47320139

版权

c++ 专栏收录该内容

31 篇文章

订阅专栏

 int Array[8] = {1, -2, 3, 10, -4, 7, 2, -5};
	int sum = 0;
	int MaxSum = -100;
	
	for (int Index = 0; Index <8; Index ++)
	{
		sum =0;

		for (int iStartIndex = Index; iStartIndex <8; iStartIndex++)
		{
			sum += Array[iStartIndex];

			if (sum >MaxSum)
			{
				MaxSum = sum;
			}
		}
	}

	cout<<MaxSum <<endl;