nyist 737 区间DP-石子合并 dfs

2014-11-24 02:54:32 · 作者: · 浏览: 1

点个赞~

#include
  
   
#include
   
     #include
    
      #include
     
       #include
      
        using namespace std; #define inf 233333333 int n,a[205],sum[205]; int dp[205][205]; int dfs(int i, int j){ //返回合并[i,j]的最小值 if(dp[i][j] < inf)return dp[i][j]; if( i >= j) return dp[i][j] = 0; if(i+1 == j) return dp[i][j] = a[i] + a[j]; for(int p=i; p