1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 | import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.HashMap; import java.util.StringTokenizer; public class Main { public static void main(String[] args) { FastScanner sc = new FastScanner(); int n = sc.nextInt(); int[][] ar = new int[n+1][3]; int[][] dp = new int[n+1][3]; int[][] dp2 = new int[n+1][3]; for(int i=1;i<=n;i++){ for(int j=0;j<3;j++){ ar[i][j] = sc.nextInt(); // System.out.print(ar[i][j]+" "); } // System.out.println(); } for(int i=1;i<=n;i++){ for(int j=0;j<3;j++){ if(j==0){ dp[i][j] = Math.max(dp[i-1][j], dp[i-1][j+1])+ar[i][j]; dp2[i][j] = Math.min(dp2[i-1][j], dp2[i-1][j+1])+ar[i][j]; }else if(j==1){ dp[i][j] = Math.max(dp[i-1][j-1], Math.max(dp[i-1][j], dp[i-1][j+1]))+ar[i][j]; dp2[i][j] = Math.min(dp2[i-1][j-1], Math.min(dp2[i-1][j], dp2[i-1][j+1]))+ar[i][j]; }else{ dp[i][j] = Math.max(dp[i-1][j-1], dp[i-1][j])+ar[i][j]; dp2[i][j] = Math.min(dp2[i-1][j-1], dp2[i-1][j])+ar[i][j]; } } } int max = Math.max(dp[n][0], Math.max(dp[n][1], dp[n][2])); int min = Math.min(dp2[n][0], Math.min(dp2[n][1], dp2[n][2])); System.out.println(max+" "+min); } } class FastScanner { BufferedReader br; StringTokenizer st; public FastScanner() { br = new BufferedReader(new InputStreamReader(System.in)); } String nextToken() { while (st == null || !st.hasMoreElements()) { try { st = new StringTokenizer(br.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return st.nextToken(); } int nextInt() { return Integer.parseInt(nextToken()); } long nextLong() { return Long.parseLong(nextToken()); } double nextDouble() { return Double.parseDouble(nextToken()); } String nextLine() { String str = ""; try { str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } return str; } } | cs |
'알고리즘' 카테고리의 다른 글
[1912번] 연속합 (0) | 2017.12.05 |
---|---|
[2193번] 이친수 (0) | 2017.08.13 |
[11729번] 하노이 탑 이동 순서 (0) | 2017.08.13 |
[11053번] 가장 긴 증가하는 부분 수열 (0) | 2017.08.13 |
[9084번] 동전 (0) | 2017.08.13 |