题目:
给定N个整数的序列{A1,A2,...,},求函数f(i,j)=max{0,}的最大值。
方法一:三重循坏 O(N^3)
#include<iostream>
using namespace std;
const int N = 10000;
int MaxSubseqSum(int a[], int n)
{
int ThisSum, MaxSum = 0;
int i,j,k;
for(i=0; i<n; i++)
{
for(j=i; j<n; j++)
{
ThisSum = 0;
for(k=i; k<=j; k++)
{
ThisSum += a[k];
}
if(ThisSum > MaxSum)
MaxSum = ThisSum;
}
}
return MaxSum;
}
int main()
{
int a[N];
int n ;
cin>>n;
for(int i=0; i<n; i++) scanf("%d",&a[i]);
int sum = MaxSubseqSum(a,n);
cout<<sum<<endl;
return 0;
}
方法二:两重循坏 O(N^2)
int MaxSubseqSum(int a[], int n)
{
int ThisSum, MaxSum = 0;
int i,j;
for(i=0; i<n; i++)
{
ThisSum = 0;
for(j=i; j<n; j++)
{
ThisSum += a[j]; //对于相同的i,不同的j,只需要在j-1次循环的基础上累加1项a[j]即可
if(ThisSum > MaxSum) MaxSum = ThisSum;
}
}
return MaxSum;
}
方法三: 分治 O(NlogN)
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 10000;
int MaxSubseqSum(int a[], int l, int r)
{
//递归的终止条件,子列只有1个数字
if(l == r)
{
if(a[l] > 0)
{
return a[l];
}
else return 0;
}
int mid = l + r >> 1; //找到中点
int leftMaxSum = MaxSubseqSum(a,l,mid); //递归求得左半部分子列的最大和
int rightMaxSum = MaxSubseqSum(a,mid+1,r); //递归求得右半部分子列的最大和
int leftMax =0, rightMax = 0,sum = 0;
//左边
for(int i = l; i <= mid; i++)
{
sum += a[i];
if(sum > leftMax) leftMax = sum;
}
//右边
sum = 0;
for(int i=mid+1 ;i <= r; i++)
{
sum += a[i];
if(sum > rightMax) rightMax = sum;
}
//三者选最大
return max(max(leftMaxSum,rightMaxSum),leftMax+rightMax);
}
int main()
{
int a[N];
int n ;
cin>>n;
for(int i=0; i<n; i++) scanf("%d",&a[i]);
int sum = MaxSubseqSum(a,0,n-1);
cout<<sum<<endl;
return 0;
}
复杂度T(N) = 2T(N/2) + cN = 2[ 2T(N / 2^2) + cN/2] = 2^k O(1) + c k N = O(NlogN)
(其中N/2^k = 1)。
四:“在线处理”算法 O(N)
int MaxSubseqSum( int a[],int n)
{
int ThisSum ,MaxSum;
int i;
ThisSum = MaxSum = 0;
for(i=0; i<n; i++)
{
ThisSum += a[i]; //向右累加
if(ThisSum > MaxSum)
MaxSum = ThisSum; //发现更大则更新
else if(ThisSum < 0) //如果当前子列和为负
ThisSum = 0;//则不可能使后面的部分和增大,所以抛弃
}
return MaxSum;
}