View Code of Problem 19

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stdbool.h>
typedef struct{
	char name[20];
	int flag;
}Children;
int a[1000010];
int max(int a,int b){
	return a>b?a:b;
}
int main(){
	int n;
	while(scanf("%d",&n)!=EOF&&n!=0){
		for(int i=0;i<n;i++){
			scanf("%d",&a[i]);
		}
		int lastMax=a[0];
		int Max=a[0];
		for(int i=1;i<n;i++){
			lastMax=max(a[i],lastMax+a[i]);
			Max=max(lastMax,Max);
		}
		printf("%d\n",Max);
	}
} 




	

Double click to view unformatted code.


Back to problem 19