BEAKJOON JAVA ALGORITHM #9465(스티커)

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

import java.util.Scanner; public class a9465 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); for(int i=0; i<num; i++) { int t = sc.nextInt(); int[][] arr = new int[t+1][3]; for(int j=1; j<=2; j++) { for(int k=1; k<=t; k++) { arr[k][j] = sc.nextInt(); } } int[][] d = new int[t+1][3]; for(int j=1; j<=t; j++) { d[j][0] = Math.max(d[j-1][0], Math.max(d[j-1][1], d[j-1][2])); d[j][1] = Math.max(d[j-1][0], d[j-1][2]) + arr[j][1]; d[j][2] = Math.max(d[j-1][0], d[j-1][1]) + arr[j][2]; } System.out.println(Math.max(d[t][0], Math.max(d[t][1], d[t][2]))); } } }