# 1007. Maximum Subsequence Sum (25)

400 ms

65536 kB

16000 B

Standard

CHEN, Yue

Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1 <= i <= j <= K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.

Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.

Input Specification:

Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (<= 10000). The second line contains K numbers, separated by a space.

Output Specification:

For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.

Sample Input:
10
-10 1 2 3 4 -5 -23 3 7 -21

Sample Output:
10 1 4
#include<stdio.h>
using namespace std;

int buf[10002];

int main()
{
freopen("F://Temp/input.txt", "r", stdin);
int n;
scanf("%d", &n);

for(int i = 0; i < n; i ++)
scanf("%d", &buf[i]);

bool neg_flag = true;//是否全部是负数
for(int i = 0; i < n; i ++)
if(buf[i] >= 0)
{
neg_flag = false;
break;
}

if(neg_flag)
{
printf("0 %d %d\n", buf[0], buf[n-1]);
return 0;
}

int start, end;
int max = -1, tmp_sum = 0;
for(int i = 0; i < n; i ++)
{
tmp_sum += buf[i];

if(tmp_sum > max)
{
max = tmp_sum;
end = i;
}
else if(tmp_sum < 0)
tmp_sum = 0;
}
max = -1, tmp_sum = 0;
for(int i = end; i >= 0; i --)
{
tmp_sum += buf[i];
if(tmp_sum > max)
{
max = tmp_sum;
start = i;
}
}

printf("%d %d %d\n", max, buf[start], buf[end]);
return 0;
}

• 本文已收录于以下专栏：

## PAT 1007 Maximum Subsequence Sum（最长子段和）

PAT 1007 Maximum Subsequence Sum（最长子段和）

## 1007. Maximum Subsequence Sum (25)

1007. Maximum Subsequence Sum (25)目录Maximum Subsequence Sum 25 目录 原题 思路 代码原题 Given a sequence of K...

## 1007. Maximum Subsequence Sum (25)

Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, ...

## 1007. Maximum Subsequence Sum (25)

Given a sequence of K integers { N1, N2, …, NK }. A continuous subsequence is defined to be { Ni, Ni...

## 1007. Maximum Subsequence Sum (25)

Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, ...

## 浙大 PAT Advanced level 1007. Maximum Subsequence Sum

Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, ...

## 1007. Maximum Subsequence Sum (25)

1007. Maximum Subsequence Sum (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 ...

Pat1007代码 题目描述： Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence...

## PAT1007. Maximum Subsequence Sum (25)

Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, ...

## 1007. Maximum Subsequence Sum (25)

Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, ...

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)