【日常练习】HDU 1003 Max Sum

Max Sum

---

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 214109 Accepted Submission(s): 50320

---

Problem Description
Given a sequence a[1],a[2],a[3]……a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.

---

Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).

---

Output
For each test case, you should output two lines. The first line is “Case #:”, # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.

---

Sample Input
2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5

---

Sample Output
Case 1:
14 1 4

Case 2:
7 1 6

---

题意

给出t表示有t组数据，接下来有每次给出n个数在给出n个数内找出最大连续子序列的和。。

---

AC代码：

#include<bits/stdc++.h>
using namespace std;

int num;
int main(){
    int t;
    scanf("%d",&t);
    int cas = 0;
    while(t--){
        int n;
        scanf("%d",&n);
        int item = 1;
        int start = 1;
        int end = 1;
        int sum = 0;
        int maxn = -15212;
        for(int i = 1;i <= n;i++){
            scanf("%d",&num);
            sum += num;
            if(maxn < sum){
                maxn = sum;
                start = item;
                end = i;
            }
            if(sum < 0){
                sum = 0;
                item = i + 1;
            }
        }
        printf("Case %d:\n%d %d %d\n",++cas, maxn,start,end);
        if(t){
            printf("\n");
        }
    }return 0;
}

---

我开始的做法是从0开始做循环，item作为记录开始的位置，初始化为0；然后把start和end分别加1。。。样例都可以，也测试了其他数据。然并卵。一发一发蜜汁WA。。。。
好心疼啊。。。蜜汁尴尬