[정올 1836] 연속부분합 찾기

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1109&sca=99&sfl=wr_hit&stx=1836 

JUNGOL

#include <stdio.h>

int sum[100010], max, N;

int main(void) {
	scanf(" %d", &N);

	for (int i = 1; i <= N; i++) {
		int tmp;
		scanf(" %d", &tmp);

		if (sum[i - 1] > 0)
			sum[i] = sum[i - 1] + tmp;
		else
			sum[i] = tmp;
		
		if (sum[i] > max)
			max = sum[i];
	}

	printf("%d\n", max);

	return 0;
}