This is my code of sub_maximum 2
#include
#include
using namespace std;
int main()
{
int a[8]={-4,1,3,-2,6,2-8,-9,4},sumarr[8]={0};
int left=-1,right=-1,max_sum=INT_MIN,sum;
sumarr[0]=a[0];
for(int i=1;i<=8;i++)
{
sumarr[i]=sumarr[i-1]+a[i];
}
for(int i=0;i<=8;i++)
{
for( int j=i;j<=8;j++)
{
sum=0;
sum=sumarr[j]-sumarr[i-1];
if(max_sum<sum)
{
max_sum=sum;
left=i;
right=j;
}
}
}
cout<<"Max Sum = "<<max_sum<<endl;
for(int i=left;i<=right;i++)
{
cout<<a[i];
}
}
