Problem Description
给定n(1<=n<=50000)个整数(可能为负数)组成的序列a[1],a[2],a[3],…,a[n],求该序列如a[i]+a[i+1]+…+a[j]的子段和的最大值。当所给的整数均为负数时定义子段和为0,依此定义,所求的最优值为: Max{0,a[i]+a[i+1]+…+a[j]},1<=i<=j<=n。 例如,当(a[1],a[2],a[3],a[4],a[5],a[6])=(-2,11,-4,13,-5,-2)时,最大子段和为20。
注意:本题目要求用分治递归法求解,除了需要输出最大子段和的值之外,还需要输出求得该结果所需的递归调用总次数。
递归调用总次数的获得,可以参考以下求菲波那切数列的代码段中全局变量count的用法:
#include
int count=0;
int main()
{
int n,m;
int fib(int n);
scanf("%d",&n);
m=fib(n);
printf("%d %d\n",m,count);
return 0;
}
int fib(int n)
{
int s;
count++;
if((n==1)||(n==0)) return 1;
else s=fib(n-1)+fib(n-2);
return s;
}
Input
第一行输入整数n(1<=n<=50000),表示整数序列中的数据元素个数;
第二行依次输入n个整数,对应顺序表中存放的每个数据元素值。
Output
一行输出两个整数,之间以空格间隔输出:
第一个整数为所求的最大子段和;
第二个整数为用分治递归法求解最大子段和时,递归函数被调用的总次数。
Example Input
6 -2 11 -4 13 -5 -2Example Output
20 11
code:
#include<stdio.h> #include<stdlib.h> int count; typedef struct { int *p; int length; int maxsize; }list; int max(int a, int b, int c) { int maxnum = a; if(b>maxnum) maxnum = b; if(c>maxnum) maxnum = c; return maxnum; } void creat(list &L) { L.maxsize = 50010; L.length = 0; L.p = (int *)malloc(L.maxsize*sizeof(int)); } void input(list &L, int len) { int i; L.length = len; for(i = 0;i<len;i++) { scanf("%d", &L.p[i]); } } int maxsum(list &L, int left, int right) { count++; int sum = 0; if(right == left) { if(L.p[left]>=0) { sum = L.p[left]; } else { sum = 0; } } else { int mid; mid = (left+right)/2; int sumleft, sumright; sumleft = maxsum(L, left, mid); sumright = maxsum(L, mid+1, right); int sum1, sum2, thissum, midsum; thissum = sum1 = 0; for(int i = mid;i>=left;i--) { thissum+=L.p[i]; if(thissum>sum1) { sum1 = thissum; } } thissum = sum2 = 0; for(int i = mid+1;i<right;i++) { thissum+=L.p[i]; if(thissum>sum2) { sum2 = thissum; } } midsum = sum1+sum2; sum = max(sumleft, sumright, midsum); } return sum; } int main() { int n, sum; count = 0; list L; creat(L); scanf("%d", &n); input(L, n); sum = maxsum(L, 0, n-1); printf("%d %d\n", sum, count); }