动态规划入门（数字三角形）

package dp;
import java.util.Scanner;
public class MaxContinueArraySum {
	public static void main(String[] args) {
	   Scanner scanner=new Scanner(System.in);
	   int r=scanner.nextInt();
	   int [][]a=new int [r+2][r+2];
	   int [][]dp=new int [r+2][r+2];
	   for(int i=1;i<=r;i++)
	   {
		   for(int j=1;j<=i;j++)
		   {
			   a[i][j]=scanner.nextInt();
		   }
	   }
	   for(int j=1;j<=r;j++)
	   {
		   dp[r][j]=a[r][j];
	   }
	   for(int i=r-1;i>=1;i--)
	   {
		   for(int j=1;j<=i;j++)
		   {
			   dp[i][j]=a[i][j]+Math.max(dp[i+1][j], dp[i+1][j+1]);
		   }
	   }
	   System.out.println(dp[1][1]);
	}
}