1007 Maximum Subsequence Sum (25分)
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
题意为寻找一个数列的最大子列和,并输出该子列的首项和末项
原数列全为负数的话最大子数列和为0,首项和末项为原数列首项和末项
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
#define SUM 100001
int k;
int temp_sum = 0, result = 0;
int temp_begin = 0;
int the_begin = 0, the_end = 0;
int num[SUM];
int main() {
cin >> k;
for (int i = 1; i <= k; i++) {
cin >> num[i];
if (temp_sum == 0 && num[i] <= 0) {
continue;
}
if (temp_sum == 0) {
temp_begin = num[i];
}
temp_sum += num[i];
if (temp_sum - num[i]<temp_sum && temp_sum>result) {
the_begin = temp_begin;
the_end = num[i];
result = temp_sum;
}
if (temp_sum < 0) {
temp_sum = 0;
}
}
if (*max_element(num + 1, num + 1 + k) < 0) {//该函数效率极高
the_begin = num[1];
the_end = num[k];
}
cout << result << " " << the_begin << " " << the_end << endl;
return 0;
}
有点动态规划的意思