最大子数组-分治算法

//最大子数组问题
#include <iostream>

using namespace std;

#define MIN -1024
#define MAX 0x7fffff


//找跨越重点的最大字数组
void FindMaxCrossingSubArray(int *arr, int low, int mid, int high, int &maxLeft, int &maxRight, int &crossSum)
{
	int leftSum = MIN;
	int sum = 0;
	for (int i = mid; i >= low; i--)
	{
		sum += arr[i];
		if (sum > leftSum)
		{
			leftSum = sum;
			maxLeft = i;
		}
	}
	int rightSum = MIN;
	sum = 0;
	for (int i = mid + 1; i <= high; i++)
	{
		sum += arr[i];
		if (sum > rightSum)
		{
			rightSum = sum;
			maxRight = i;
		}
	}
	crossSum = leftSum + rightSum;
}




void FindMaximumSubArray(int *arr, int low, int high, int &left, int &right, int &sum)
{
	if (high == low)             //base case:only one element
	{
		left = low;
		right = high;
		sum = arr[low];
	}
	else
	{
		int mid = (int)((low + high) / 2);
		//left
		int tempLeftLow, tempLeftHigh, tempLeftSum;
		FindMaximumSubArray(arr, low, mid, tempLeftLow, tempLeftHigh, tempLeftSum);
		//right
		int tempRightLow, tempRightHigh, tempRightSum;
		FindMaximumSubArray(arr, mid + 1, high, tempRightLow, tempRightHigh, tempRightSum);
		//cross
		int tempCrossLow, tempCrossHigh, tempCrossSum;
		FindMaxCrossingSubArray(arr, low, mid, high, tempCrossLow, tempCrossHigh, tempCrossSum);

		if (tempLeftSum >= tempRightSum&&tempLeftSum >= tempCrossSum)
		{
			left = tempLeftLow;
			right = tempLeftHigh;
			sum = tempLeftSum;
		}
		else if (tempRightSum >= tempLeftSum&&tempRightSum >= tempCrossSum)
		{
			left = tempRightLow;
			right = tempRightHigh;
			sum = tempRightSum;
		}
		else
		{
			left = tempCrossLow;
			right = tempCrossHigh;
			sum = tempCrossSum;
		}

	}
}

int main()
{
	int Arr[] = {3,-2,4,-3,5,36,-888,12,-5,-46,8,90,-97,98,-1,-3,6,-2};
	int maxLeft, maxRight, crossSum;
	//FindMaxCrossingSubArray(Arr, 0, 6, 11, maxLeft, maxRight, crossSum);
	FindMaximumSubArray(Arr,0,17,maxLeft,maxRight,crossSum);
	cout << maxLeft << " " << maxRight << " " << crossSum << endl;
	return 0;
}