【计算机考研机试指南】第十二章 动态规划：最大连续子序列和——最大序列和_清华

寻找状态转移方程 

dp[i] 是以A[i]作为末尾的连续序列最大和

#include <iostream>
#include <cstdio>

using namespace std;

const int MAXN = 1000000;

long long arr[MAXN];
long long dp[MAXN];

long long MaxSubsequence(int n){
	long long maximum = 0;
	for(int i = 0; i < n; i++){
		if(i == 0){
			dp[i] = arr[i];
		}else{
			dp[i] = max(arr[i], dp[i-1] + arr[i]);
		}
		maximum = max(maximum, dp[i]);
	}
	return maximum;
}

int main(int argc, char** argv) {
	int n;
	while(scanf("%d", &n) != EOF){
		for(int i = 0; i < n; i++){
			scanf("%lld", &arr[i]);
		}
		long long answer = MaxSubsequence(n);
		printf("%lld\n", answer); 
	}	
	
	return 0;
}