HDU 1003 Max Sum(dp)

题目链接：HDU 1003 Max Sum

dp。

跟上道题是一样的。注意这句话： Output a blank line between two cases.

#include <iostream>
#include <stdio.h>
#include <cstring>

using namespace std;

const int MAX_N = 100000 + 100;
int dp[MAX_N],arr[MAX_N];
int _beg[MAX_N];
int k,T,num;

int main()
{
    scanf("%d",&T);
    num = 0;
    while(T--)
    {
        scanf("%d",&k);
        for(int i = 1;i <= k;i++)
            scanf("%d",&arr[i]);
        dp[1] = arr[1];
        int temp = 1;
        _beg[1] = temp;
        for(int i = 2;i <= k;i++)
        {
            if(dp[i - 1] + arr[i] >= arr[i])
            {
                dp[i] = dp[i - 1] + arr[i];
                _beg[i] = temp;
            }
            else
            {
                dp[i] = arr[i];
                _beg[i] = temp = i;
            }
        }
        int _max = -MAX_N;
        int j = 0;
        for(int i = 1;i <= k;i++)
        {
            if(_max < dp[i])
            {
                _max = dp[i];
                j = i;
            }
        }
        printf("Case %d:\n%d %d %d\n",++num,_max,_beg[j],j);
        if(T)
            printf("\n");
    }
    return 0;
}