杭电1003 Max Sum

#include <iostream>
using namespace std;
/*
int main()
{
    int T, N, i, j, a[100001];
    cin >> T;
    for (j = 0; j < T; j++)
    {
        cin >> N;
        for (i = 0; i < N; i++)
            cin >> a[i];
        int maxSum = a[1];
        int  sum = 0, l = 0, r = 0, temp = 0;
        for (i = 0; i<N; i++)
        {
            sum = sum + a[i];
            if (sum>maxSum)
            {
                maxSum = sum;
                l = temp;
                r = i;
            }
            if (sum < 0)
            {
                sum = 0;
                temp = i + 1;
            }
        }

        cout << "Case " << j+1 << ":" << endl;
        cout << maxSum << " " << l + 1 << " " << r + 1 << endl;
        if (j < T - 1)
            cout << endl;

    }
    return 0;

}*/

暴力解法

#include <iostream>
using namespace std;
/*
int main()
{
    int n,k=1,d;
    int a[10000];
    int max=0, stl=1, enl=1;
    int sum = 0, temp = 1;
    cin >> d;
    for (int w = 0; w < d; w++)
    {
        cin >> n;
        a[0] = n;

        for (int i = 1; i < n + 1; i++)
        {
            cin >> a[i];
        }
        //cout << a[0] << endl;
        //cout << a[1] << endl;
        //cout << a[2] << endl;
        for (int i = 1; i < n + 1; i++)
        {
            //cout << "已运行了1";
            sum = a[i];
            for (int j =i+1; j<n + 1; j++)
            {
                sum += a[j];
                //cout << "已运行了2";
                if (sum>max)
                {
                    max = sum;
                    stl = i;
                    enl = j;
                }
            }
        }
        cout << "Case" << " " << w + 1<<endl;
        cout << max << " " << stl << " " << enl<<endl;
        if (w < d - 1) cout << endl;
        max = 0; stl = 1; enl = 1;
    }
    return 0;

}*/