算法分类:
动态规划
代码实现:(HDU1231)
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
using namespace std;
const int N = 10005;
int data[N];
int K;
int main()
{
while (scanf("%d",&K)!=EOF, K) {
for (int i = 1; i <= K; ++ i)
scanf("%d",&data[i]);
/**
* 定理:设A(i,j)是满足S(i,j)<0的任意子序列,如果q>j,那么A(i,q)不是
* 最大连续子序列。
* 定理:对于任意i,设A(i,j)是满足S(i,j)<0的第一个序列,那么,对于任何
* i <= p <= j和p <= q,A(p,q)或不是一个最大的连续子序列,或等于一个已经
* 出现过的最大连续子序列。
*/
int maxSum, thisSum, seqStart, seqEnd;
maxSum = thisSum = seqStart = seqEnd = 0;
for (int i = 1, j = 1; j <= K; ++ j) {
thisSum += data[j];
if (thisSum > maxSum) {
maxSum = thisSum;
seqStart = i;
seqEnd = j;
} else if (thisSum < 0) {
i = j + 1;
thisSum = 0;
}
}
printf("%d %d %d\n",maxSum, data[seqStart], data[seqEnd]);
}
}