0%

最大子数列和

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
#include <stdio.h>

#define MAX 100000

int main(void) {

int count;
int array[MAX];
int i;
int maxSum;
int tempSum;
<!-- more -->
scanf("%d", &count);
for (i = 0; i < count; i++) {
scanf("%d", &array[i]);
}

maxSum = 0;
tempSum = 0;
for (i = 0; i < count; i++) {
tempSum += array[i];
if (tempSum > maxSum) {
maxSum = tempSum;
}
if (tempSum < 0) {
tempSum = 0;
}
}

printf("%d", maxSum);

return 0;
}