对原问题有如下解
1.最大子序列在数组中点的左边
2.最大子序列在数组中点的右边
3.最大子序列跨越数组中点
#include<iostream>
using namespace std;
int FIND_MAX_CROSSING_SUBARRAY(int a[],int low,int high)
{
int mid = (low+high)/2;
int i = mid;
int j = mid+1;
int left_sum = 0;
int right_sum = 0;
int sum = 0;