[백준] 1912 연속합 [자바]

---

https://medium.com/@vdongbin/kadanes-algorithm-%EC%B9%B4%EB%8D%B0%EC%9D%B8-%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98-acbc8c279f29

Kadane’s Algorithm (카데인 알고리즘)

 

---

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
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];
		StringTokenizer st = new StringTokenizer(br.readLine(), " ");
		for(int i = 0; i < N; i++) {
			arr[i] = Integer.parseInt(st.nextToken());
		}
		if(N == 1)
			System.out.println(arr[0]);
		else {
			int max = arr[0];
			int result = max;
			for(int i = 1; i < N; i++) {
				max = Math.max(arr[i], max+arr[i]);
				if(result < max)
					result = max;
			}
			System.out.println(result);
		}
	}
}