最大子区间问题

#include<bits/stdc++.h>
using namespace std;
int maxsubsum(int a[]){
    int thissum=0,maxsum=0;
    int idx[2]={0};
    for(int i=0;i<6;i++){
        thissum+=a[i];
        if(thissum<0){
            idx[0]=i+1;
            thissum=0;
        }
        else if(thissum>maxsum){
            maxsum=thissum;
            idx[1]=i;
        }
    }
    cout<<idx[0]<<" "<<idx[1]<<endl;
    return maxsum;
}
int main()
{
    int a[6]={-2,11,-4,13,-5,-2};
    cout<<maxsubsum(a)<<endl;
}