最大数组问题(maximum subarray)和矩阵乘法的Srtassen算法

一.最大子数组问题

今天在看《深入理解计算机系统》的时候，在p105页作者给出了INT_MIN在标准头文件limits.h中的定义

#define INT_MAX 2147483647

#define INT_MIN (-INT_MAX - 1)

这里没有简单地将INT_MIN赋值成-2147483647，是因为-2147483648对于编译器而言是个表达式，而2147483648对于32-bit整数是无法表示的，所以经过这个表达式的结果是未定义的。在GCC上直接写-2147483648后，编译器给出了警告，说结果是unsigned。

这里有一篇文章提到了其中的缘由，可以参考：INT_MIN

暴力求解：定义 i,j,k,用三个for循环，用k为自增在i,j中寻找，运用temp相加，进行运算。求解得答案。

#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<cstring>
using namespace std;
int maximum_subarray(int *a,int len)
{
	//int len = 0;
	//len = sizeof(a) / sizeof(a[0]);
	int summax = INT_MIN;
	int i, j, k;
	for(i=0;i<len;i++)
		for (j = 0; j < len; j++)
		{
			int temp = 0;
			for (k = i; k <= j; k++)
				temp += a[k];
			if (temp > summax)summax = temp;
		}
	return summax;
}
int main()
{
	int a[] = { 3,-1,2,5,-3,4,-6,-7,1,8,-3,5,9 };
	printf("the maximum_subarray:%d\n", maximum_subarray(a,13));
	return 0;
}

2.分治求解

#include<iostream>
#include<algorithm>
using namespace std;
int max_middle(int *num, int l, int m, int r)
{
	int summax = INT_MIN;
	int r_max = INT_MIN;
	int l_max = INT_MIN;
	int temp ;
	temp = 0;
	for (int i = m; i >= l; i--)
	{
		temp+=num[i];
		if (temp > l_max)l_max = temp;
	}
	temp = 0;
	for (int i = m+1; i<=r; i++)
	{
		temp += num[i];
		if (temp > l_max)r_max = temp;
	}
	return (l_max + r_max);
}
int max_subsetarray(int *num, int l, int r)
{
	if (l == r)return num[l];
	else {
		int m = (l + r) / 2;
		int l_max = INT_MIN,
			r_max = INT_MIN,
			c_max = INT_MIN;
		l_max = max_subsetarray(num, l, m);
		r_max = max_subsetarray(num, m + 1, r);
		c_max = max_middle(num, l, m, r);
		if (l_max >= r_max && l_max >= c_max)return l_max;
		else if (r_max >= l_max && r_max >= c_max)return r_max;
		else return c_max;
	}
}
int main()
{
	int num[] = { 13,-3,-25,20,-3,-16,-23,18,20,-7,12,-5,-22,15,-4,7 };
	printf("the max_subsetarray of is:%d\n", max_subsetarray(num, 0, 15));
	return 0;
}

三.线性时间求解

非常的巧妙，精辟，值得玩味。

#include<iostream>
using namespace std;
int maxsubset(int *a, int l, int r)
{
	int i;
	int temp = 0;
	int summax = INT_MIN;
	for (i = l; i <= r; i++) {
		temp += a[i];
		if (temp > summax)summax = temp;
		if (temp < 0)temp = 0;
	}
	return summax;
}
int main()
{
	int a[] = { 13,-3,-25,20,-3,-16,-23,18,20,-7,12,-5,-22,15,-4,7 };
	printf("the maxsubset:%d\n", maxsubset(a, 0, 15));
	return 0;
}

4.dp算法

#include<iostream>
using namespace std;
int FindMaxsubarray(int array[], int length)
{
	int start = 0, end = 0;
	int Maxsumsub;
	int* dp = new int[length];
	dp[0] = array[0];
	Maxsumsub = dp[0];
	int temp = 0;
	for (int i = 1; i < length; i++)
	{
		if (dp[i - 1] <= 0)
		{
			dp[i] = array[i];
			temp = i;
		}
		else dp[i] = array[i] + dp[i - 1];
		if (dp[i] > Maxsumsub)
		{
			Maxsumsub = dp[i];
			start = end;
			end = i;
		}
	}
	cout << "最大子序列下标:" << start << "->" << end << endl;
	return Maxsumsub;
}
int main()
{
	int a[] = { 13, -3, -25, 20, -3, -16, -23, 18, 20, -7, 12, -5, -22, 15, -4, 7 };
	int length = sizeof(a) / sizeof(int);
	cout << FindMaxsubarray(a, length)<<endl;
	return 0;
}