[BOJ] 백준 1912 연속합

[문제]

https://www.acmicpc.net/problem/1912

 

 

[소스 코드]

import java.io.*;
import java.util.*;
public class Main {
    public static void main(String[] args) throws IOException {
    	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    	StringTokenizer st;
    	int n = Integer.parseInt(br.readLine());
    	int[] arr = new int[n+1];
    	st = new StringTokenizer(br.readLine());
    	for(int i=1;i<=n;i++) {
    		arr[i] = Integer.parseInt(st.nextToken());
    	}
    	int[] dp = new int[n+1];
    	for(int i=1;i<=n;i++) {
    		dp[i] = Math.max(0, dp[i-1]) + arr[i];
    	}
    	int max = Integer.MIN_VALUE;
    	for(int i=1;i<=n;i++) {
    		max = Math.max(dp[i], max);
    	}
    	System.out.println(max);
    }
}