1007. Maximum Subsequence Sum

clelouch

于 2018-03-08 11:03:02 发布

阅读量135

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT Advanced

本文链接：https://blog.youkuaiyun.com/clelouch/article/details/79481556

PAT Advanced 专栏收录该内容

12 篇文章

订阅专栏

本文介绍了一个用于寻找数组中最大连续子数组及其起始和结束位置的算法实现。通过读取输入文件中的整数数组，该程序能够找出并输出具有最大和的连续子数组及其边界元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main() {
	freopen("D://input.txt", "r", stdin);
	vector<int> input;
	int sum, maxStart, maxSum, maxEnd, start, ter, i, items;
	cin >> items;
	input.resize(items);

	for (i = 0; i < items; i++)
		cin >> input[i];

	maxSum = maxStart = maxEnd = 0;
	sum = start = ter = -1;
	for (i = 0; i < items; i++) {
		if (sum < 0 && input[i] >= 0) {
			start = input[i];
			sum = 0;
		}
		sum += input[i];
		if (sum > 0) {
			ter = input[i];
		}

		if (sum > maxSum) {
			maxStart = start;
			maxSum = sum;
			maxEnd = ter;
		}
	}
	if (start != -1)
		cout << maxSum << " " << maxStart << " " << maxEnd << endl;
	else
		cout << 0 << " " << input[0] << " " << input[input.size() - 1] << endl;
	return 0;
}