因为本题是线性求解,且当得到x'位置的小球时,在0~x'区间的小球绝对被取到,故考虑区间DP。
定义f[i][j][k]指从左往右第i~j个小球被取到。
(k = 0)在左端点,(k = 1)在右端点。
为了方便,我们可以在原点设置一个y = 0的小球
f[i][j][0] = max(f[i + 1][j][0] + (X(i + 1) - X(i)) * (Y(i) - t * V(i)),f[i + 1][j][1] + (X(j) - X(i) * (Y(i) - t * V(i)))
f[i][j][1]同理
#include <iostream>
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
struct code {
long long x;
long long y;
long long v;
}eg[1005];
long long n,s;
long long f[1005][1005][2];
long long sum[1005] = {0};
bool cmp (code Ta,code Tb) {
return Ta.x < Tb.x;
}
int main () {
cin >> n >> s;
for (int i = 1; i <= n; i++) {
cin >> eg[i].x;
}
for (int i = 1; i <= n; i++) {
cin >> eg[i].y;
}
for (int i = 1; i <= n; i++) {
cin >> eg[i].v;
}
eg[n + 1].x = s;
eg[n + 1].y = 0;
eg[n + 1].v = 0;
sort(eg + 1,eg + n + 2,cmp);
memset(f,-INF,sizeof(f));
for (int i = 1; i <= n + 1; i++) {
sum[i] = sum[i - 1] + eg[i].v;
if (eg[i].x == s && eg[i].y == 0) {
f[i][i][1] = f[i][i][0] = 0;
}
}
for (int k = 1; k <= n + 1; k++) {
for (int i = 1; i + k <= n + 1; i++) {
int j = i + k;
f[i][j][0] = eg[i].y + max(f[i + 1][j][0] - (eg[i + 1].x - eg[i].x) * (sum[n + 1] + sum[i] - sum[j]),f[i + 1][j][1] - (eg[j].x - eg[i].x) * (sum[n + 1] + sum[i] - sum[j]));
f[i][j][1] = eg[j].y + max(f[i][j - 1][1] - (eg[j].x - eg[j - 1].x) * (sum[n + 1] + sum[i - 1] - sum[j - 1]),f[i][j - 1][0] - (eg[j].x - eg[i].x) * (sum[n + 1] + sum[i - 1] - sum[j - 1]));
}
}
printf("%.3lf\n",max(f[1][n + 1][1],f[1][n + 1][0]) * 1.0 / 1000);
return 0;
}