题意:在同一时刻,有n个人同时点了外卖,人和店在同一直线上,外卖小哥每v秒走一米(人都要饿死了),现在每一个点餐人员每秒钟增加一定的怒气值,问外卖小哥送完所有人的外卖后怒气值最小为多少
我们先将所有点餐人员及饭店的坐标从小到大排好序,然后以饭店为中心,向外扩散,直到所有人都送完
dp[i][j][0] = min(dp[i][j][0], dp[i + 1][j][0] + (date[i+1].x - date[i].x) * (sum[n] - sum[j] + sum[i]));
dp[i][j][0] = min(dp[i][j][0], dp[i + 1][j][1] + (date[j].x - date[i].x) * (sum[n] - sum[j] + sum[i]));
dp[i][j][1] = min(dp[i][j][1], dp[i][j - 1][1] + (date[j].x - date[j - 1].x) * (sum[n] - sum[j-1] + sum[i-1]));
dp[i][j][1] = min(dp[i][j][1], dp[i][j - 1][0] + (date[j].x - date[i].x) * (sum[n] - sum[j-1] + sum[i-1]));
dp[i][j]表示区间i-j内的人配送完成后的怒气值,第三维的0表示送完i-j的外卖后外卖小哥在区间的左侧,1表示送完区间i-j的外卖后外卖小哥在区间的右侧。
如果最后停在左侧,则上移状态是送完区间i+1-j的外卖然后送i位置的外卖,所以上移状态可能是dp[i+1][j][0]和dp[i+1][j][1],在移动的过程中,位置0-i和j+1-n的人怒气值在增加。最后停在右侧同理。
AC代码
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#define inf 0x3f3f3f3f
using namespace std;
const int N = 1e3 + 10;
typedef long long ll;
const ll mod = 998244353;
ll dp[N][N][3];
struct node {
int x;
int v;
}date[N];
int sum[N];
bool cmp(node a, node b) {
return a.x < b.x;
}
int main() {
ios::sync_with_stdio(false);
int n, v, x;
while (cin >> n >> v >> x) {
memset(dp, inf, sizeof(dp));
for (int i = 1; i <= n; i++) cin >> date[i].x >> date[i].v;
date[++n].v = 0;
date[n].x = x;
sort(date + 1, date + 1 + n, cmp);
int top = 0;
for (int i = 1; i <= n; i++) {
if (date[i].x == x) {
top= i;
break;
}
}
dp[top][top][1] = dp[top][top][0] = 0;
for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + date[i].v;
for (int i = top; i >= 1; i--) {
for (int j = top; j <= n; j++) {
if (i == j) continue;
dp[i][j][0] = min(dp[i][j][0], dp[i + 1][j][0] + (date[i+1].x - date[i].x) * (sum[n] - sum[j] + sum[i]));
dp[i][j][0] = min(dp[i][j][0], dp[i + 1][j][1] + (date[j].x - date[i].x) * (sum[n] - sum[j] + sum[i]));
dp[i][j][1] = min(dp[i][j][1], dp[i][j - 1][1] + (date[j].x - date[j - 1].x) * (sum[n] - sum[j-1] + sum[i-1]));
dp[i][j][1] = min(dp[i][j][1], dp[i][j - 1][0] + (date[j].x - date[i].x) * (sum[n] - sum[j-1] + sum[i-1]));
}
}
cout << v*min(dp[1][n][0], dp[1][n][1]) << endl;
}
}