题目链接:点击打开链接
给出一个序列, 让你输出子序列最大和以及子序列的起点和终点的值, 最大和为负则输出0以及序列的起点和终点的值.
对每个读入的数累加, 比ans大则更新ans与起点终点, 若加到某处小于0则更新tmp与起点.
AC代码:
#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 0x3f3f3f3f;
int n, a[MAXN];
int main(int argc, char const *argv[])
{
while(scanf("%d", &n) != EOF && n) {
int ans = -INF, tmp = 0, x, st, ed, num = 1;
for(int i = 1, j = 1; j <= n; ++j) {
scanf("%d", &x);
a[num++] = x;
tmp += x;
if(tmp > ans) {
ans = tmp;
st = i;
ed = j;
}
if(tmp < 0) {
i = j + 1;
tmp = 0;
}
}
if(ans >= 0) printf("%d %d %d\n", ans, a[st], a[ed]);
else printf("0 %d %d\n", a[1], a[n]);
}
return 0;
}