Pangu and Stones HihoCoder - 1636 (区间DP) 2017区域赛北京站
PanguandStones题目链接:HihoCoder-1636题意:现有n堆石子,每次合并k堆石子,L=2时,dp[i][j][k]=min(dp[i][i+x][k-1]+dp[i+x+1][j][1]|i#defineINF0x3f3f3f3fusingnamespacestd;intsum[110][110],dp[110][110][110],a[110];intmain(){intN