01-复杂度1 最大子列和问题

#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);
	}