A1007 Maximum Subsequence Sum （25 分）

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 10010;
int n,A[maxn],dp[maxn],b[maxn];
bool flag = false;
int main()
{
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &A[i]);
		if (A[i] >= 0) flag = true;
	}
	if (flag == false)
	{
		printf("0 %d %d", A[0], A[n-1]);
		return 0;
	}
  b[0]=dp[0] = A[0];
	for (int i = 1; i < n; i++)
	{
		if (A[i] > A[i] + dp[i - 1])
		{
			b[i] = A[i];
			dp[i] = A[i];
		}
		else
		{
			b[i] = b[i - 1];
			dp[i] = A[i] + dp[i - 1];
		}
	}
	int max = dp[0];
	int k=0;//不要忘记给k赋初值
	for (int i = 0; i < n; i++)
	{
		if (dp[i] > max)
		{
			max = dp[i];
			k = i;
		}
	}
    printf("%d %d %d", max, b[k], A[k]);
	return 0;
}