백준 Java 1912_연속합

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
 
public class Main {
	
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int N = Integer.parseInt(br.readLine());
		
		int[] arr = new int[N];
		int[] dp = new int[N];
 
		StringTokenizer st = new StringTokenizer(br.readLine(), " ");
		
		for(int i = 0; i < N; i++) {
			arr[i] = Integer.parseInt(st.nextToken());
		}
		dp[0] = arr[0];
		int max = arr[0];
		
		for (int i = 1; i < N; i++) {
	
			dp[i] = Math.max(dp[i - 1] + arr[i], arr[i]);
		//dp 배열 원소들중 가장 큰 값을 찾아서 출력 => max 값 갱신을 통해
			max = Math.max(max, dp[i]);
		}
		System.out.println(max);
 
	}
}