数据结构练习（二）——Max Sum of Subarray

求一给定序列所有子序列中，最大的和为多少
——————————————————————————————
例子：
input：A[8] = {1, -1, 2, -2, -1, -1, 5, -1}
output:5
——————————————————————————————
分析：
显然子序列{5}的和最大。
——————————————————————————————

#include "iostream"
#include "cstdlib"
#include "cstdio"
#include<limits.h>
#include <iomanip>
#include <ctime>

#define TEST_LEN 8

using namespace std;

template <typename T3>
T3 FindMaxSubarray(T3 *A,int low,int hi);

template <typename T4>
T4 FindMaxCrossingSubarray(T4 *A,int low,int mid,int hi);

template <typename T5>
T5 max(T5,T5,T5);

int main()
{
	int Array[TEST_LEN];
	int seed = time(nullptr);
	srand(seed);
	for(int i = 0;i < TEST_LEN;i++)
		Array[i] = ((rand()*10) /RAND_MAX -4);
	for(int i = 0;i < TEST_LEN;i++)
	{
		cout << setiosflags(ios::left) << setw(5)<< i;
	}
	cout << endl;
	for(int i = 0;i < TEST_LEN;i++)
	{
		cout << setiosflags(ios::left) << setw(5) << Array[i];
	}
	cout << endl;
	int sum = FindMaxSubarray(Array,0,TEST_LEN-1);
	cout << sum;
//	MergeSort(Array,0,20);
//	for(int i = 0;i < 20;i++)
//	{
//		cout << setw(5) << Array[i];
//	}
	return 0;
}
template <typename T3>
T3 FindMaxSubarray(T3 *A,int low,int hi)
{
	if(low >= hi)
	{
		printf("lo = hi\n");
		return A[low];
	}
	int mid = (hi + low)/2;
	printf("FindMaxCrossingSubarray(%d,%d,%d )\n",low,mid,hi);
	int a1 = FindMaxCrossingSubarray(A,low,mid,hi)
	printf("FindMaxSubarray(%d,%d)\n",mid+1,hi);
	int a2 = FindMaxSubarray(A,mid+1,hi);
	printf("FindMaxSubarray(%d,%d)\n",low,mid);
	int a3 = FindMaxSubarray(A,low,mid);
	return max(a1,a2,a3);

}
template <typename T4>
T4 FindMaxCrossingSubarray(T4 *A,int low,int mid,int hi)
{
	int LeftSum = INT_MAX + 1;
	int sum = 0;
	int max_left = mid;
//	printf("find left subarray cross %d th\n",mid);
	for(int i = mid;i >= low ; i--)
	{
		sum = sum + A[i];
		if(sum > LeftSum)
		{
			LeftSum = sum;
			max_left = i;
		}
	}
	int RightSum = INT_MAX + 1;
	sum = 0;
	int max_right = mid;
//	printf("find right subarray cross %d th\n",mid);
	for(int i = mid;i <= hi ; i++)
	{
		sum = sum + A[i];
		if(sum > RightSum)
		{
			RightSum = sum;
			max_right = i;
		}
	}
	printf("(low = %d,mid = %d,hi = %d) max subarray = %d \n",low,mid,hi,RightSum+LeftSum-A[mid]);
	int a1 = RightSum+LeftSum-A[mid];
	return a1;
}
template <typename T5>
T5 max(T5 a1,T5 a2,T5 a3)
{
	if(a1 >= a2)
	{
		if(a1 >= a3)
			return a1;
		else
			return a3;
	}
	else
	{
		if(a2 >= a3)
			return a2;
		else
			return a3;
	}
}