hdu 1003

动态规划，一直加和，小于0就重新加。找最大值

AC代码：

#include <iostream>  using namespace std;int main(){int j, i, k, n, m, t;int a[100002];scanf("%d", &t);for (j = 1; j <= t; j++){scanf("%d", &n);for (i = 0; i<n; i++){scanf("%d", &a[i]);}int sum = 0, maxsum = -1001, first = 0, last = 0, temp = 1;for (i = 0; i<n; i++){sum += a[i];if (sum > maxsum){maxsum = sum; first = temp; last = i + 1;}if (sum < 0){sum = 0; temp = i + 2;}}printf("Case %d:\n%d %d %d\n", j, maxsum, first, last);if (j != t){printf("\n");}}return 0;}