子数组最大值求和

#include<iostream>
using namespace std;

void main()
{
    int i,x,y,z;
    int s,sum,head,end,h,e;
    cout<<"请输入数组的长度：";
    cin>>x;
    cout<<"请输入数组的取值范围:";
    cin>>z;
    int *a=new int[x];
    
    if(x==0)
    { 
        cout<<"错误"<<endl;
        return 0;       
    }

    for(i=0;i<x;i++)
    {
        a[i]=rand()%z;
        y=rand()%2;
        if(y==0)
        {
            a[i]=-a[i];
        }
    }
      
    sum=0;
    s=0;
    e=0;
    h=0;

    for(i=0;i<x;i++)
    {
        s+=a[i];
        if(s>0)
        {
            e++;
        }
        else
        {
            s=0;
            h=i+1;
            e++;
        }
        if(s>sum)
        {
            sum=s;
            head=h;
            end=e;
        }
    }
    cout<<"最大子数组的和为："<<sum<<endl;
    delete a;

}