最大子数组问题

每周坚持搞三种算法问题，介绍一下最大子数组问题

算法思路：分治策略求解，将问题不断分为更小的问题，进而求解

问题描述：求数组中相连着的数 相加值最大，例如"{-3,2,3,-4,21,-5},输出最大为2+3-4+21=22"

代码：

#define _CRT_SECURE_NO_WARNIGNS
#include <stdio.h>
#include <stdlib.h>
#include <float.h>
#define N 10
#define Min_Float -FLT_MAX
float Find_Max_Crossing_Subarray(float Array[],int low,int mid,int high)//输出过中点的最大和
{
	int i;
	int max_left;
	float left_sum =Min_Float;
	float Lsum = 0;
	float sum = 0;
	for (i = mid; i >= low; i--)
	{
		Lsum += Array[i];
		if (Lsum > left_sum)
		{
			left_sum = Lsum;
			max_left = i;
		}
	}
	int max_right;
	float right_sum = Min_Float;
	float Rsum = 0;
	for (i = mid + 1; i <= high; i++)
	{
		Rsum += Array[i];
		if (Rsum > right_sum)
		{
			right_sum = Rsum;
			max_right = i;
		}
	}
	sum = left_sum + right_sum;
	return sum;
}
float Find_Maximum_Subarray(float Array[],int low,int high)//判断两边和过中点数组和哪个大
{
	if (high == low)
	{
		return Array[low];
	}
	else
	{
		int mid = (low + high) / 2;
		float left_sum=Find_Maximum_Subarray(Array, low, mid);
		float right_sum=Find_Maximum_Subarray(Array, mid + 1, high);
		float cross_sum = Find_Max_Crossing_Subarray(Array, low, mid, high);
		if (left_sum >= right_sum && left_sum >= cross_sum)
		{
			return left_sum;
		}
		else if (right_sum >= left_sum && right_sum >= cross_sum)
		{
			return right_sum;
		}
		else
		{
			return cross_sum;
		}
	}
	
}
void main()
{
	float Array[N] = { -4.5, 2, 5, -15, -12, -4, -6, -9.2, -21, -4.3 };
	float sum = Find_Maximum_Subarray(Array, 0, 9);
	printf("%.1f", sum);
	system("pause");
}