HDU 1003 动态规划最大子序列和

**

HDU 1003 动态规划最大子序列和

**

#include <iostream>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int a[100001];
    for(int i = 0; i < n; i++)
    {
        int N;
        cin >> N;
        for(int j = 0; j < N; j++)
            cin >> a[j];
        int ThisSum = 0, index = 0, l  = 0, r = 0;
        int MaxSum = a[0];
        for(int j = 0; j < N; j++)
        {
            ThisSum += a[j];
            if(ThisSum > MaxSum)
            {
                MaxSum = ThisSum;   
                l = index;
                r = j;
            }
            if(ThisSum < 0)
            {
                ThisSum = 0; 
                index = j + 1;
            }
        }
        l++;
        r++;
        cout << "Case " << i + 1 << ":" << endl;
        cout << MaxSum << " " << l << " " << r << endl;
        if(i < n - 1)
            cout << endl;
    }
}

1. 最大值初始化

2. 第二个 if 不能写成else if 负数比大小和正数不一样

3. 尽可能优化算法效率