算法笔记（3）---最大子数组

//采用分治策略求出一个含有负数的数组中，和最大的一个子数组
//子数组的情况必属于：1、只在左侧 2、只在右侧 3、过中点 因此最大子数组必属于这三种情况
//我们只需要求出每种情况的最大子数组，进行比较，就可以得到最大子数组
//1、求出begin~mid的最大子数组
//2、求出mid+1~begin的最大子数组
//3、利用数组i~j=i~mid+(mid+1)~begin求出跨越数组中点的最大子数组
//4、三者比较求出最大子数组
#include<iostream>
#include<vector>
using namespace std;
constexpr int maxn = 200;
constexpr int inf = 0x3f3f3f3f;
int a[maxn];
struct Node {
	int left = 0;
	int right = 0;
	int sum = 0;
};

Node FindMaxCrossingSubarray(int left, int right)
{
	int leftsum = -inf;//记录左边子数组的最大值
	int sum = 0;//记录左边数组所有和
	int mid = (left + right) >> 1;
	//由于需要跨过mid值，所以需要从mid向right、left两端寻找
	int maxleft = mid;
	int maxright = mid + 1;
	for (int i = mid; i >= left; i--)
	{
		sum = sum + a[i];
		if (sum > leftsum)
		{
			leftsum = sum;
			maxleft = i;//记录最大子数组的下标
		}
	}
	//同理
	int rightsum = -inf;
	sum = 0;
	for (int i = mid + 1; i <= right; i++)
	{
		sum = sum + a[i];
		if (sum > rightsum)
		{
			rightsum = sum;
			maxright = i;
		}
	}
	Node out;
	out.left = maxleft;
	out.right = maxright;
	out.sum = leftsum + rightsum;
	return out;
}

Node FindMaximumSubarray(int left, int right)
{
	Node out;
	Node leftnum, rightnum, crossnum;//左边子数组、右边子数组、过mid的子数组
	if (left == right)
	{//当分到所有数组只有一个元素时开始递归
		out.left = left;
		out.right = right;
		out.sum = a[left];
		return out;
	}
	int mid = (left + right) >> 1;
	//在子数组中寻找其左边，过mid，右边的最大子数组，原理同文章开头
	leftnum = FindMaximumSubarray(left, mid);
	rightnum = FindMaximumSubarray(mid + 1, right);
	crossnum = FindMaxCrossingSubarray(left, right);
	//将三个数组进行比较，求出最大子数组，并返回
	if (leftnum.sum >= rightnum.sum && leftnum.sum >= crossnum.sum)
		return leftnum;
	else if (rightnum.sum >= leftnum.sum && rightnum.sum >= crossnum.sum)
		return rightnum;
	else
		return crossnum;
}

int main()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	Node out;
	out = FindMaximumSubarray(1, n);
	cout << "max left = " << out.left<<' ' << "max right = " << out.right <<' '<< "sum = " << out.sum << endl;
	return 0;
}