MaximumSumSubarray_bruteforce01.cpp

#include<cmath>
#include<iostream>
#include<climits>
using namespace std;

int Maximum_Sum_Subarray(int arr[],int n)		//Overall Time Complexity O(n^3)
{
	int ans = INT_MIN;							// #include<climits>
	for(int sub_array_size = 1;sub_array_size <= n; ++sub_array_size)		//O(n)
	{
		for(int start_index = 0;start_index < n; ++start_index)				//O(n)
		{
			if(start_index+sub_array_size > n)	//Subarray exceeds array bounds
				break;
			int sum = 0;
			for(int i = start_index; i < (start_index+sub_array_size); i++)	//O(n)
				sum+= arr[i];
			ans = max(ans,sum);
		}
	}
	return ans;
}

int main(int argc, char const *argv[])
{
	int arr[] = {3,-2,5,-1};
	cout<<MSS(arr,4)<<"\n";
	return 0;
}

I have a question how can I return the start and the end of the maximum subarray?
Like from where it begins and ends.

@chai2champ this function is not working for large constraints