版权声明: https://blog.csdn.net/nwpu2017300135/article/details/81564355
题解:关掉一个区间的等,可以转换成更小的区间,区别在于从这个小区间的哪一段跑。
代码:
#include <iostream>
#include <cstdio>
#include<cstring>
#define maxn 60
using namespace std;
int a[maxn],b[maxn],f[maxn][maxn][2],sum[maxn];
int n,c;
int main()
{
int i,l,j;
scanf("%d%d",&n,&c);
memset(f,0x7f,sizeof(f));
for(i=1;i<=n;i++)scanf("%d%d",&a[i],&b[i]);
for(i=1;i<=n;i++)sum[i]=sum[i-1]+b[i];
f[c][c][0]=f[c][c][1]=0;
for(l=2;l<=n;l++){
for(i=1;i+l-1<=n;i++){
j=i+l-1;
f[i][j][0]=min(f[i+1][j][0]+(a[i+1]-a[i])*(sum[n]-sum[j]+sum[i]),f[i+1][j][1]+(a[j]-a[i])*(sum[n]-sum[j]+sum[i]));
f[i][j][1]=min(f[i][j-1][1]+(a[j]-a[j-1])*(sum[n]-sum[j-1]+sum[i-1]),f[i][j-1][0]+(a[j]-a[i])*(sum[n]-sum[j-1]+sum[i-1]));
}
}
printf("%d\n",min(f[1][n][0],f[1][n][1]));
// cout << "Hello world!" << endl;
return 0;
}