fork download
copy 
  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner input = new Scanner(System.in);
  6.  
  7.         int n = input.nextInt();
  8.         long[] a = new long[n+1];
  9.         long[] b = new long[n+1];
  10.         long[] c=new long[n+1];
  11.  
  12.         int i = 0;
  13.         while (i < n) {
  14.             a[i]=input.nextLong();
  15.             b[i] = input.nextLong();
  16.             c[i] = input.nextLong();
  17.             i++;
  18.         }
  19.  
  20.         long[] dpa = new long[n+1];
  21.         long[] dpb = new long[n+1];
  22.         long[] dpc = new long[n+1];
  23.         dpa[0]=a[0];
  24.         dpb[0]=b[0];
  25.         dpc[0]=c[0];
  26.         i=1;
  27.         while(i<n){
  28.         	dpa[i]=a[i]+Math.max(dpb[i-1],dpc[i-1]);
  29.         	dpb[i] = b[i] + Math.max(dpa[i-1], dpc[i-1]);
  30.             dpc[i] = c[i] + Math.max(dpa[i-1], dpb[i-1]);
  31.         	i++;
  32.         }
  33.         System.out.println(Math.max(dpa[n-1], Math.max(dpb[n-1], dpc[n-1])));
  34.     }
  35. }
  36.  
Success #stdin #stdout 0.13s 56640KB
comments (?)
stdin
copy 
3
10 40 70
20 50 80
30 60 90
stdout
copy 
210
https://ideone.com/SPaEeG
language:
Java (HotSpot 12)
created:
19 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!