From dbf1d9de41ec7210e97c1777543ca75d11707481 Mon Sep 17 00:00:00 2001 From: Jinyeong Seol Date: Fri, 5 Dec 2025 23:52:23 +0900 Subject: [PATCH] =?UTF-8?q?[20251205]=20BOJ=20/=20G5=20/=20=EC=97=B0?= =?UTF-8?q?=EC=86=8D=ED=95=A9=202=20/=20=EC=84=A4=EC=A7=84=EC=98=81?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Implement solution for BOJ G5 Continuous Sum 2 problem. --- ...\354\227\260\354\206\215\355\225\251 2.md" | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 "Seol-JY/202512/05 BOJ G5 \354\227\260\354\206\215\355\225\251 2.md" diff --git "a/Seol-JY/202512/05 BOJ G5 \354\227\260\354\206\215\355\225\251 2.md" "b/Seol-JY/202512/05 BOJ G5 \354\227\260\354\206\215\355\225\251 2.md" new file mode 100644 index 00000000..b418455b --- /dev/null +++ "b/Seol-JY/202512/05 BOJ G5 \354\227\260\354\206\215\355\225\251 2.md" @@ -0,0 +1,32 @@ +```java +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)); + 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()); + } + + int dp0 = arr[0]; + int dp1 = Integer.MIN_VALUE / 2; + + int answer = dp0; + + for (int i = 1; i < n; i++) { + dp1 = Math.max(dp1 + arr[i], dp0); + dp0 = Math.max(dp0 + arr[i], arr[i]); + + answer = Math.max(answer, Math.max(dp0, dp1)); + } + + System.out.println(answer); + } +} + +```