1007 Maximum Subsequence Sum (25 分)
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
测试输出:
2 -1 0 应输出 0 0 0
1 0 应输出 0 0 0
2 -1 -2 应输出0 -1 -2
高效迭代:(从论坛一位老铁那看来的)
#include<iostream>
#include<vector>
using namespace std;
struct Result {
int front, back, sum;
}result, temp;
int main() {
int n;
cin >> n;
vector<int> vc(n);;
for (int i = 0; i < n; i++) {
cin >> vc[i];
temp.sum += vc[i];
if (i == 0)
result = temp;
if (temp.sum < vc[i]) {
temp.sum = vc[i];
temp.front = i;
}
if (temp.sum > result.sum) {
temp.back = i;
result = temp;
}
}
if (result.sum < 0)
cout << 0 << " " << vc.front() << " " << vc.back();
else
cout << result.sum << " " << vc[result.front] << " " << vc[result.back];
return 0;
}
无脑遍历
#include<iostream>
#include<vector>
using namespace std;
struct Result {
int front = -1, back = -1;
int sum;
}result, temp;
int main() {
int n, j;
cin >> n;
vector<int> vc(n);
for (int i = 0; i < n; i++) {
cin >> vc[i];
temp = { i,i,0 };
while (temp.front >= 0) {
temp.sum += vc[temp.front];
if ((result.front - 1 && -1 == result.back) || temp.sum > result.sum) //首尾都为-1说明未初始化
result = temp;
temp.front--;
}
}
if (result.sum < 0)
cout << 0 << " " << vc.front() << " " << vc.back();
else
cout << result.sum << " " << vc[result.front] << " " << vc[result.back];
return 0;
}