View Code of Problem 19

#include<stdio.h>
#include<malloc.h>

int main() {
	int n;
	while (scanf("%d", &n), n != 0) {
		int *p = (int *)malloc(n * sizeof(int));
		for (int i = 0;i < n;i++) {
			scanf("%d", &p[i]);
		}
		int max = p[0]+p[1];
		for (int i = 0;i < n;i++) {
			int sum = p[i];
			for (int j = i + 1;j < n;j++) {
				sum = sum + p[j];
				if (sum > max)
					max = sum;
			}
		}
		printf("%d\n", max);
		

	}
	return 0;

}