题目
给定K个整数的序列{ N1, N2, …, NK },其任意连续子序列可表示为{ Ni, Ni+1, …, Nj },其中 1 <= i <= j <= K。最大连续子序列是所有连续子序列中元素和最大的一个, 例如给定序列{ -2, 11, -4, 13, -5, -2 },其最大连续子序列为{ 11, -4, 13 },最大和 为20。
Input
6
-2 11 -4 13 -5 -2
10
-10 1 2 3 4 -5 -23 3 7 -21
6
5 -8 3 2 5 0
1
10
3
-1 -5 -2
3
-1 0 -2
0
Output
20 11 13
10 1 4
10 3 5
10 10 10
0 -1 -2
0 0 0
两种方法实现:
#include<stdio.h>
#pragma warning (disable:4996)
#define N 10000
//实现一
void MaxSubSum1(const a[],int n)
{
int left, maxleft, maxright, sum;
int max = -1;
left = maxleft= sum = 0;
maxright = n - 1;
for (int i = 0; i < n; i++)
{
sum += a[i];
if (sum < 0)
{
left = i + 1;
sum = 0;
}
else if (sum>max)
{
max = sum;
maxleft = left;
maxright = i;
}
}
if (max < 0)
{
max = 0;
}
printf("%d %d %d\n",max,a[maxleft],a[maxright]);
}
//最大连续子数组之和
void MaxSubSum(const a[], int n)
{
//求最大连续子数组之和
int S[N];//存储连续子序列的最大和
int i, left, right;
S[0] = a[0];
left = 0; right = n - 1;
for (int i = 0; i < n; i++)
{
if (S[i - 1]>0)
{
S[i] = S[i - 1] + a[i];
}
else
{
S[i] = a[i];
}
}
//求最大子数组的右边界
for (right = i = 0; i < n; i++)
{
if (S[i]>S[right])
{
right = i;
}
}
//求最大子数组的左边界
for (i = right; i >= 0; i--)
{
if (S[i] < 0)
{
break;
}
}
left = i+1;
if (S[right] < 0)
{
left = 0;
right = n - 1;
S[right]=0;
}
printf("%d %d %d\n",S[right],a[left],a[right]);
}
int main()
{
int num = 0;
int arr[N];
int temp = 0;
while(scanf("%d",&num)!=EOF&&num!=0)
{
for (int i = 0; i < num; i++)
{
scanf("%d",&temp);
arr[i] = temp;
}
MaxSubSum(arr,num);
}
return 0;
}