HDUOJ 1003: Max Sum

#include <iostream>
#include <stdio.h>
using namespace std;

int main()
{
    int c, input, maxSum, frontPos, tempFrontPos, tailPos, tempSum;
    int ct = 1;
    scanf("%d", &c);
    while(c--)
    {
        tempSum = 0;
        maxSum = -1000000000;
        tempFrontPos = frontPos = tailPos = 0;
        int n;
        scanf("%d", &n);
        for(int i = 0; i < n; ++i)
        {
            scanf("%d", &input);
            tempSum += input;
            if(tempSum > maxSum)
            {
                maxSum = tempSum;
                tailPos = i;
                frontPos = tempFrontPos;
            }
            if(tempSum < 0 && (i != n - 1)) //i != n - 1 保证 frontPos 不会指到一个不存在的位置
            {
                tempSum = 0;
                tempFrontPos = i + 1;
            }
        }
        printf("Case %d:\n", ct++);
        printf("%d %d %d\n", maxSum, frontPos+1, tailPos+1);
        if(c != 0) printf("\n");
    }
    return 0;
}