版权声明:本文为博主原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。
#include <stdio.h>
/*
2017/10/2 20:07 by com.stw.beans
*/
int a[10]={3,6,-4,6,-1,5,-6,7,2,-5};
int x,y,m;
int L,R;
int max3(int i, int j, int k)
{
if (i>=j && i>=k)
return i;
return max3(j, k, i);
}
int maxsum(int x, int y)
{
if (x > y) return 0;
if (x == y) return a[x];
int m = (x + y) / 2;
int L=a[m], lsum=0;
for (int i=m; i>=x; i--) {
lsum += a[i];
if (lsum > L)
L = lsum;
}
int R=a[m+1], rsum = 0;
for (int i=m+1; i<=y; i++) {
rsum += a[i];
if (rsum > R)
R = rsum;
}
int MaxL=maxsum(x,m);
int MaxR=maxsum(m+1,y);
return max3(L+R, MaxL, MaxR); //返回三者最大值
}
int main(void)
{
int max=a[0];
x=0;
y=10;
max=maxsum(x,y);
printf("最大值为%3d\n",max);
}
/*
2017/10/2 20:07 by com.stw.beans
*/
int a[10]={3,6,-4,6,-1,5,-6,7,2,-5};
int x,y,m;
int L,R;
int max3(int i, int j, int k)
{
if (i>=j && i>=k)
return i;
return max3(j, k, i);
}
int maxsum(int x, int y)
{
if (x > y) return 0;
if (x == y) return a[x];
int m = (x + y) / 2;
int L=a[m], lsum=0;
for (int i=m; i>=x; i--) {
lsum += a[i];
if (lsum > L)
L = lsum;
}
int R=a[m+1], rsum = 0;
for (int i=m+1; i<=y; i++) {
rsum += a[i];
if (rsum > R)
R = rsum;
}
int MaxL=maxsum(x,m);
int MaxR=maxsum(m+1,y);
return max3(L+R, MaxL, MaxR); //返回三者最大值
}
int main(void)
{
int max=a[0];
x=0;
y=10;
max=maxsum(x,y);
printf("最大值为%3d\n",max);
}