# 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;
}

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

## 1007. Maximum Subsequence Sum (25) -- 动态规划

1007. Maximum Subsequence Sum (25)题目地址Given a sequence of K integers { N1, N2, …, NK }. A continuous...
• qq_26437925
• 2015年08月13日 21:11
• 702

## 【PAT】1007. Maximum Subsequence Sum (25)

• realxuejin
• 2013年08月23日 16:11
• 1446

## 1007. Maximum Subsequence Sum (25)-PAT甲级真题（动态规划dp）

1007. Maximum Subsequence Sum (25) Given a sequence of K integers { N1, N2, …, NK }. A continuo...
• liuchuo
• 2016年08月07日 20:13
• 528

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

PAT 1007 Maximum Subsequence Sum（最长子段和）
• Dacc123
• 2016年05月26日 19:37
• 544

## 1007.Maximum Subsequence Sum (25)

1007.Maximum Subsequence Sum (25)pat-al-10072017-02-04 最大子段和，动态规划典型题 为什么maxSum必须设置为-1，不然有个测试点过不了，想不通...
• ymdq1113
• 2017年02月04日 23:43
• 74

## PAT-Java-1007. Maximum Subsequence Sum (25)

1007. Maximum Subsequence Sum (25) 题目阐述 Given a sequence of K integers { N1, N2, …, NK }. A con...
• rebornyp
• 2018年01月13日 17:24
• 33

## PAT 01-2. Maximum Subsequence Sum (25) - Python

PAT 01-2. Maximum Subsequence Sum (25)Given a sequence of K integers { N1, N2, …, NK }. A continuous...
• jixiangrurui
• 2015年08月16日 14:02
• 314

## PAT TEST甲级1007. Maximum Subsequence Sum (25)

• happyerin123
• 2017年01月22日 14:30
• 620

## PAT (Advanced Level) 1007. Maximum Subsequence Sum (25) 解题报告

1007. Maximum Subsequence Sum (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 ...
• qq_21899803
• 2017年01月24日 18:44
• 155

## 【DP-最大子串和】PAT1007. Maximum Subsequence Sum

1007. Maximum Subsequence Sum (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判...
• XBWer
• 2014年06月23日 01:21
• 1055

举报原因： 您举报文章：1007. Maximum Subsequence Sum 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)