C语言 分治法求解最大子数组

 数组A[low, high]的任何连续子数组A[i, j]所处的位置必然是以下三种情况之一：

1. 完全位于子数组A[low, mid]中，因此low≤i≤j≤mid。
2. 完全位于子数组A[mid+1, high]中，因此mid<i≤j≤high。
3. 跨越了中点，因此low≤i≤mid<j≤high。

我们可以利用分治法递归地求解A[low, mid]和A[mid+1, high]的最大子数组，因为这两个子问题仍是最大子数组问题，只是规模更小。因此，剩下的全部工作就是寻找跨越中点的最大子数组，然后在三种情况中选取和最大者。

我们可以很容易地在线性时间内求出跨越中点的最大子数组。因为任何跨越中点的子数组都由两个子数组A[i, mid]和A[mid+1, j]组成，其中low≤i≤mid且mid<j≤high。因此，我们只需找出形如A[i, mid]和A[mid+1, j]的最大子数组，然后将其合并即可。 

// 求解最大子数组
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int* findMaxCrossingSubarray(int* a, int low, int mid, int high);
int* findMaximumSubarray(int* a, int low, int high);

int main(void)
{
	int a[] = { 13,-3,-25,20,-3,-16,-26,18,20,-7,12,-5,-22,15,-4,7 };
	int* temp = findMaximumSubarray(a, 0, sizeof(a) / sizeof(a[0]) - 1);

	printf("low:%d\nhigh:%d\nsum:%d", temp[0], temp[1], temp[2]);

	return 0;
}
int* findMaxCrossingSubarray(int* a, int low, int mid, int high)
{
	int leftSum = -2147483647;
	int rightSum = -2147483647;
	int i, j;
	int maxLeft, maxRight;

	int sum = 0;
	for (i = mid; i >= low; i--)
	{
		sum += a[i];
		if (sum >= leftSum)
		{
			leftSum = sum;
			maxLeft = i;
		}
	}
	sum = 0;
	for (j = mid + 1; j <= high; j++)
	{
		sum += a[j];
		if (sum >= rightSum)
		{
			rightSum = sum;
			maxRight = j;
		}
	}

	int* temp = (int*)malloc(sizeof(int) * 3);
	temp[0] = maxLeft;
	temp[1] = maxRight;
	temp[2] = leftSum + rightSum;

	return temp;
}
int* findMaximumSubarray(int* a, int low, int high)
{
	int* res = (int*)malloc(sizeof(int) * 3);

	if (low == high)
	{
		res[0] = low;
		res[1] = high;
		res[2] = a[low];

		return res;
	}
	else
	{
		int* left = (int*)malloc(sizeof(int) * 3);
		int* right = (int*)malloc(sizeof(int) * 3);
		int* cross = (int*)malloc(sizeof(int) * 3);
		int mid = (low + high) / 2;

		memcpy(left, findMaximumSubarray(a, low, mid), sizeof(int) * 3);
		memcpy(right, findMaximumSubarray(a, mid + 1, high), sizeof(int) * 3);
		memcpy(cross, findMaxCrossingSubarray(a, low, mid, high), sizeof(int) * 3);

		if (left[2] >= right[2] && left[2] >= cross[2])
			return left;
		else if (right[2] >= left[2] && right[2] >= cross[2])
			return right;
		else if (cross[2] >= left[2] && cross[2] >= right[2])
			return cross;
	}
}