输出一维环形数组中最大子数组和最大子数组的位置

#include<iostream.h>
#include<time.h>
#include<stdlib.h>
int main()
{
    int arry[20];
    int start,end,i;
    long sum,max;
    cout<<"Please input 10 numbers:"<<endl;
    for( i=0;i<10;i++)
    {
        cin>>arry[i];
        arry[i+10]=arry[i];
    }
    max=arry[0];
    start=0;
    end=0;
    for(int j=0;j<10;j++)
    {
        sum=0;
        for(int k=j;k<10+j;k++)
        {
            sum=sum+arry[k];
            if(sum>max)
            {
                max=sum;
                start=j+1;
                end=k+1;
            }
        }
    }
    cout<<"MAX IS"<<" "<<max<<endl;
    cout<<"START:"<<"The"<<" "<<start<<"th"<<" "<<"number"<<"    "<<"END:"<<"The"<<" "<<end%10<<"th"<<" "<<"number"<<endl;
    cout<<"These numbers are:";
    for(int c=0;c<end-start+1;c++)
    {
        cout<<arry[start+c-1]<<"  ";
    }
}