#include <stdio.h> int main() { int count; scanf("%d", &count); int *a = (int *)malloc(sizeof(int) * count); int sum = 0, max = 0, end = 0; for (int i = 0;i<count;i++) { scanf("%d", &a[i]); } for (int i = 0;i<count;i++) { sum += a[i]; if (sum>max) { max = sum; } else if (sum<0) { sum = 0; } } printf("%d",max); }
01-复杂度1 最大子列和问题
猜你喜欢
转载自blog.csdn.net/qq_29718605/article/details/80262101
今日推荐
周排行