코테 공부
[DP]문제#2. 연속합(백준 1912번),자바
DaEun_
2022. 4. 14. 22:07
import java.util.Scanner;
public class Main {
static int n;
static int[] arr;
static int[] dp;
public static void main(String[] args) {
int answer=Integer.MIN_VALUE;
Scanner in=new Scanner(System.in);
n=in.nextInt();
dp=new int[n];
//dp=new int[n];
for(int i=0;i<n;i++) {
dp[i]=in.nextInt();
}
answer=Math.max(answer, dp[0]);
for(int i=1;i<n;i++) {
dp[i]=Math.max(dp[i-1]+dp[i], dp[i]);
answer=Math.max(answer,dp[i]);
}
System.out.println(answer);
}