说是区间DP还不如说是以区间为状态的DP
考虑问题进行的过程中有什么单调连续重叠的东西 会发现黑掉的灯连在一起且每次行动黑掉一个
考虑到老张的位置对转移有影响,结合数据范围可知这不只是二维DP
暴力30分做法…dfs求全排列,为什么不用next_permutation呢。。。因为那样不能剪枝只有20分。。。
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
#define debug(x) cerr << #x << "=" << x << endl;
const int MAXN = 100000 + 10;
struct slamp{
int w,p;
}lamp[MAXN];
int n,c,vis[MAXN],ans=1<<30,sum;
int f[100][100][100],tesum,sumwo[MAXN],sumpos[MAXN];
int aabs(int x) {
if(x < 0) return -x;
return x;
}
void dfs(int x, int pre) {
if(x == n+1) {
ans = min(ans, sum);
return;
}
if(sum >= ans) return;
for(int i=1; i<=n; i++) {
if(vis[i]) continue;
vis[i] = 1;
sum += tesum * aabs(lamp[i].p - lamp[pre].p);
tesum -= lamp[i].w;
dfs(x+1, i);
tesum += lamp[i].w;
sum -= tesum * aabs(lamp[i].p - lamp[pre].p);
vis[i] = 0;
}
}
int getsum(int l, int r) {
int sum = 0;
sum = sumwo[l-1] + sumwo[n]-sumwo[r];
return sum;
}
int main() {
scanf("%d %d", &n, &c);
for(int i=1; i<=n; i++) {
scanf("%d %d", &lamp[i].p, &lamp[i].w);
tesum += lamp[i].w;
sumwo[i] = sumwo[i-1] + lamp[i].w;
}
memset(f, 0x3f, sizeof(f));
f[c][c][c] = 0;
for(int k=2; k<=n; k++) {
for(int l=1; l+k-1<=n; l++) {
int r = l+k-1;
f[l][r][r] = min(f[l][r-1][r-1] + aabs(lamp[r].p - lamp[r-1].p) * getsum(l, r-1), f[l][r-1][l] + aabs(lamp[r].p - lamp[l].p) * getsum(l, r-1));
f[l][r][l] = min(f[l+1][r][r] + aabs(lamp[r].p - lamp[l].p) * getsum(l+1, r), f[l+1][r][l+1] + aabs(lamp[l+1].p - lamp[l].p) * getsum(l+1, r));
}
}
printf("%d", min(f[1][n][1], f[1][n][n]));
return 0;
}