hdu 1003 的变形, 没什么好说的。
#include <stdio.h> const int N = 10005; const int low = -0xfffffff; int main() { int n, num[N], l, r, rec, Max, sum; while (scanf("%d", &n), n) { for (int i = 0; i < n; i++) scanf("%d", &num[i]); Max = sum = low; for (int i = 0; i < n; i++) { if (sum == low) { rec = i; sum = num[i]; } else sum += num[i]; if (sum > Max) { Max = sum; l = rec; r = i; } if (sum < 0) sum = low; } if (Max >= 0) printf("%d %d %d\n", Max, num[l], num[r]); else printf("0 %d %d\n", num[0], num[n - 1]); } return 0; }