最大连续子数列

int Text(int a[],int len)
{
    int maxsum,maxhere;
    maxsum=maxhere=a[0];
    for(int i=1; i<len; i++)
    {
        if(maxhere<=0)
        {
            maxhere=a[i];
            low=a[i];
        }
        else
        {
            maxhere+=a[i];
        }
        if(maxsum<maxhere)
        {
            maxsum=maxhere;
            high=a[i];
        }
    }
    return maxsum;
}