求和最大的数字组合。

findMax(int num[], int n){
    int i;
    int b = 0;
    int e = 0;
    int tb = 0;
    int te = 0;
    int total = 0;
    int temp = 0;
    for(i = 0; i < n; i++){
        if(temp + num[i] > num[i]){
            temp = temp + num[i];
            te = i;
        }
        else{
            tb = i;
            te = i;
            temp = num[i];
        }
        if(temp > total){
            b = tb;
            e = te;
            total = temp;
        }
    }
    printf("%d %d %d\n", b, e, total);
}

main(){
    int num[] = {1, -2, 3, 10, -4, 7, 2, -5,};
    findMax(num, 8);
}