1007 Maximum Subsequence Sum （25 分)

18分代码:

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int maxn = 10010;
int A[maxn], dp[maxn];
//1,2,3,-7,8情况不存在，因为1+2+3+(-7)<0，尽管-7+8>0
int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> A[i];
	}
	dp[0] = A[0];
	int qs[maxn] = { 0 };
	//计算dp长度
	//输出第一个最大和序列出问题，应该是
	for (int i = 1; i < n; i++) {
		if (A[i] < dp[i - 1] + A[i]) {
			dp[i] = dp[i - 1] + A[i];
			qs[i]+=(++qs[i-1]);
		}
		else {
			dp[i] = A[i];
			qs[i] = 0;
		}
		
	}
	int k = 0;
	for (int i = 1; i < n; i++) {
		if (dp[i] > dp[k])
			k = i;
	}
	if(dp[k]>0)
		printf("%d %d %d",dp[k],A[k-qs[k]+1],A[k]);
	else {
		printf("0 %d %d",A[0],A[n-1]);
	}
	return 0;
}