# 1007 Maximum Subsequence Sum (25分) [DP]

Given a sequence of K integers { N​1​​, N​2​​, ..., N​K​​ }. A continuous subsequence is defined to be { N​i​​, N​i+1​​, ..., N​j​​ } 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


CHEN, Yue

16 KB

200 ms

64 MB

# 题解：

#include <iostream>

using namespace std;

const int N = 10010;

int num[N];

int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> num[i];

int res = -1, l, r;
for (int i = 1, f = -1, start; i <= n; i++)
{
if (f < 0) f = 0, start = i;
f += num[i];
if (res < f)
{
res = f;
l = num[start], r = num[i];
}
}

if (res < 0) res = 0, l = num[1], r = num[n];
cout << res << ' ' << l << ' ' << r << endl;
return 0;
}

05-26 1250

06-04 381

08-28 83

01-17 71

10-07 1869

06-13 537

03-24 1095

03-26 4409

08-07 4491

09-23 2495

09-27 1624

05-13 278

10-03 539

10-17 414

05-11 524

07-31 526

08-28 615

02-27 1502

04-14 59万+

03-13 15万+

03-01 13万+

03-04 13万+

03-08 4万+

03-08 7万+

04-25 6万+

03-10 13万+

03-12 11万+

03-13 11万+

03-14 1万+

03-18 9633

03-19 3万+

03-19 8万+

03-19 3万+

03-22 4万+

03-24 3万+

03-25 3万+

05-08 5万+

03-25 9万+

03-27 1万+

03-29 21万+

03-29 10万+

03-30 16万+

05-28 5962

05-28 1万+

04-02 4686

04-02 4万+

04-06 7万+

04-09 8万+

04-09 2万+

05-17 8283

04-11 3万+

04-15 6万+

04-18 4万+

04-20 4万+

04-24 3万+

04-29 6956

04-30 9904

04-30 9465

05-01 6142

05-03 1万+

05-16 5万+

05-06 1万+

05-08 4万+

05-10 3203

05-14 6333

05-14 1887

05-16 3503

05-16 1万+

05-20 912

05-18 8281

05-27 1259

05-18 3473

05-19 1万+

05-21 7091

05-21 7124

05-27 5011

05-25 5106

#### 前端很容易遇到的一个大坑

©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客