51nod 1049 最大子段和

最新推荐文章于 2021-08-01 16:15:09 发布

yurio7r

最新推荐文章于 2021-08-01 16:15:09 发布

阅读量554

点赞数

文章标签：数学思维

本文链接：https://blog.csdn.net/MrSiz/article/details/50783796

版权

数学思维_习题专栏收录该内容

31 篇文章 0 订阅

订阅专栏

#include <iostream>

typedef long long ll;
const int MAX = 5e4 + 5;
ll arr[MAX];

int main()
{
	ll num;
	std::cin >> num;
	bool flag = true;
	for (ll i = 0; i != num; ++i)
	{
		std::cin >> arr[i];
		if (arr[i] > 0)
			flag = false;
	}
	if (flag)
	{
		std::cout << "0\n";
		return 0;
	}
	ll sum1 = 0, sum2 = 0;
	for (int i = 0; i != num; ++i)
	{
		if (arr[i] > sum1 + arr[i])
			sum1 = arr[i];
		//sum1 += arr[i];
		else
			sum1 += arr[i];
		if (sum1 >= sum2)
			sum2 = sum1;

	}
	std::cout << sum2 << std::endl;
	//std::cout << MaxSubArray(arr, num);
	return 0;
}