#include <stdio.h>
#include <malloc.h>
int main()
{
int t;
printf("输入整数组元素个数");
scanf("%d", &t);
int *p;
p = (int *)malloc(sizeof(int)*t); //创建一个由输入确定长度的数组
printf("输入数组");
for (int i = 0; i < t; i++)
scanf("%d", &p[i]);
int fmax=0,max = 0;
for (int i = 0; i < t; i++)
{
max += p[i];
if (max < 0)
max = 0;
if (max > fmax)
fmax = max;
}
printf("%d", fmax);
}
...全文
10318打赏收藏
浙大数据结构最大子列和问题
#include #include int main() { int t; printf("输入整数组元素个数"); scanf("%d", &t); int *p; p = (int *)malloc(sizeof(int)*t); //创建一个由输入确定长度的数组 printf("输入数组"); for (int i = 0; i < t; i++) scanf("%d", &p[i]); int fmax=0,max = 0; for (int
#include <algorithm>
int MaxSumOfSubArray(int* a, int n)
{
int maxA = 0;
int maxR = 0;
for (int i = 0; i < n; ++i)
{
maxR = std::max(a[i], maxR + a[i]);
maxA = std::max(maxA, maxR);
}
return maxA;
}