wenbao与HDU

@　　连续子序列最大和

http://acm.hdu.edu.cn/showproblem.php?pid=1003

#include <iostream>
using namespace std;
int main(){
    int t, n;
    cin >> t;
    for(int i = 1; i <= t; i++){
        if(i != 1) cout<<endl;
        cin >> n;
        int lx = 1, rx, l = 1, sum = 0, ma = -9999999, x;
        for(int j = 1; j <= n; j++){
            cin >> x;
            sum += x;
            if(sum > ma){
                ma = sum;
                lx = l;
                rx = j;
            }
            if(sum < 0){
                sum = 0;
                l = j + 1;
            }
        }
        cout<<"Case "<<i<<":"<<endl;
        cout << ma << " " << lx << " "<<rx<<endl;
    }
    return 0;
}

只有不断学习才能进步！