nefu1130Attack monsters【平行四边形优化石子合并】

//题中明确说了给定的不一定是有序的！！
<span style="background-color: rgb(255, 255, 255);"></span> #include <iostream>
#include <string.h>
#include <stdio.h>
#include<algorithm>
using namespace std;
const int INF = 1 << 30;
const int N = 1005;

int dp

;
int p

;
int sum
;
int n;

int getMinval()
{
for(int i=1; i<=n; i++)
{
dp[i][i] = 0;
p[i][i] = i;
}
for(int len=1; len<n; len++)
{
for(int i=1; i+len<=n; i++)
{
int end = i+len;
int tmp = INF;
int k = 0;
for(int j=p[i][end-1]; j<=p[i+1][end]; j++)
{
if(dp[i][j] + dp[j+1][end] + sum[end] - sum[i-1] < tmp)
{
tmp = dp[i][j] + dp[j+1][end] + sum[end] - sum[i-1];
k = j;
}
}
dp[i][end] = tmp;
p[i][end] = k;
}
}
return dp[1]
;
}

int main()
{
// freopen("cin.txt","r",stdin);
int m;
while(scanf("%d%d",&n,&m)!=EOF)
{
if(n==0&&m==0) break;
sum[0] = 0;
for(int i=1; i<=n; i++)
{
int val;
scanf("%d",&sum[i]);
//= sum[i-1] + val;
}
sum[++n]=m;
sort(sum+1,sum+1+n);
printf("%d\n",getMinval());
}
return 0;
}