HDU ACM 1 1003 Max Sum

最新推荐文章于 2021-07-23 14:32:50 发布

lunaArcher

最新推荐文章于 2021-07-23 14:32:50 发布

阅读量198

点赞数

本文链接：https://blog.csdn.net/lunaArcher/article/details/52971611

版权

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
	int K, y = 1;
	int Lu[100002], Hui;
	cin >> K;
	while (K--)
	{
		int x = 0;
		int n;
		cin >> n;
		int left, right, a, b;
		for (int i = 1; i <= n; i++)
			cin >> Lu[i];
		Hui = Lu[1], a = b = left = right = 1;
		int Max = Lu[1];
		for (int i = 2; i <= n; i++)
		{
			if (Hui >= 0)
			{
				Hui += Lu[i];
				b = i;
			}
			if (Hui < 0)
			{
				Hui = Lu[i];
				a = i;
				b = i;
			}
			if (Hui > Max)
			{
				Max = Hui;
				left = a;
				right = b;
			}
		}
		if (Max == 0)
			left = right = 0;
		cout << "Case " << y++ << ":\n" << Max << ' ' << left << ' ' << right << endl;
		if (K > 0)
			cout << endl;
	}
	return 0;
}