HDU1003(最大连续子序列）

和上一个思路一样，差别仅仅是一个输出值，一个输出位置

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1000000+10;
int s[maxn];
int n;
int dp[maxn];
int pd[maxn];
int T;
int main()
{
    cin >> T;
    int kase = 0;
    while(T--)
    {
        kase++;
        memset(s,0,sizeof(s));
        memset(dp,0,sizeof(dp));
        bool j = false;
        cin >> n;
        for(int i=0; i<n; i++)
        {
            scanf("%d",&s[i]);
            //if(s[i]>=0) j = true;
        }
        //if(!j) cout << "0" << " " << s[0] << " " << s[n-1] <<endl;
        //else
        {
            bool flag = false;
            int Max = -2147483647;
            dp[0] = s[0];
            for(int i=1; i<n; i++)
            {
                dp[i] = max( dp[i-1]+s[i] , s[i] );
            }
//        pd[n-1] = s[n-1];
//        for(int i=n-2;i>=0;i--)
//        {
//            pd[i] = max( pd[i+1]+s[i],pd[i] );
//        }

            int pos;
            for(int i=0; i<n; i++)
            {
                if(dp[i]>Max)
                {
                    Max = dp[i];
                    pos = i;
                }
            }
            int sum = 0 ;
            int b;
            for(int i=pos; i>=0; i--)
            {
                sum += s[i];
                if(sum == Max)
                {
                    b = i;
                }
            }
            cout << "Case " << kase << ":" <<endl;
            cout   <<Max <<" "<< b+1 << " " << pos+1 <<endl;
        }
        if(T!=0)cout << endl;

    }

    return 0;
}