1007. Maximum Subsequence Sum (25)

题目链接地址：http://www.patest.cn/contests/pat-a-practise/1007

求最大子序列的和是一道经典的算法问题，本解法采用动态规划法求最大子序列，时间效率高，为线性时间：

#include<iostream>
#include<memory.h>
#define max 10000
#define smallest 0X80000000

using namespace std;

int main(){
	int k;
	int num[max];
	int sub[max][2];
<span style="white-space:pre">	</span>/*sub[i][0]记录以下标为i的数为最后一个数的子序列的和,最后只需要找出所有sub[i][0]中最大的数即为最大子序列的和。。sub[i][1]记录子序列头的位置*/
	memset(sub, 0, sizeof(sub));
	
	cin >> k;
	for (int i = 0; i < k; i++)
		cin >> num[i];
	sub[0][0] = 0;
	sub[0][1] = num[0];
	for (int i = 1; i < k; i++){
		if (sub[i - 1][1] >= 0){
			sub[i][1] = sub[i - 1][1] + num[i];
			sub[i][0] = sub[i - 1][0];
		}
		else {
			sub[i][1] = num[i];
			sub[i][0] = i;
		}
	}
	int p = 0, pp = k - 1 , sum = smallest;
	for (int i = 0; i < k; i++){
		if (sub[i][1] > sum){
			sum = sub[i][1];
			p = sub[i][0];
			pp = i;
		}
	}
	if (sum < 0)
		cout << "0" << " " << num[0] << " " << num[k - 1];
	else
		cout << sum << " " << num[p] << " " << num[pp];
	return 0;
}