算法_动态规划_租用游艇问题

import java.util.Scanner;

public class Main {
private static int n;
private static int[][] cost;
private static int[][] dp;

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
n=sc.nextInt();
cost=new int[n+1][n+1];
dp=new int[n+1][n+1];
for(int i=1;i<=n-1;i++){
for(int j=i+1;j<=n;j++){
cost[i][j]=sc.nextInt();
}
}
for(int r=1;r<=n-1;r++){
for(int i=1;i<=n-1;i++){
int j=i+r;
if(j>n){
continue;
}
dp[i][j]=cost[i][j];
for(int k=i+1;k<j;k++){
dp[i][j]=Math.min(dp[i][j],dp[i][k]+dp[k][j]);
}
}
}
System.out.println(dp[1]
);
}

}