题目大意是说在一段长度为l的公路上,有n个站点,每个站点有限速,在站点i到站点i+1的区间上,每公里需要花费a[i]min;现在最多删除k个站点,问走过这条公路的最短时间
分析:
用d[i]和a[i]分别存放站点位置和限速,dp[i][j]表示前i个站点中经过了j个站点的最小时间(即删除了i-j个站点)
可得状态转移方程:dp[x][j + 1] = min(dp[x][j + 1], dp[i][j] + a[i] * (d[x] - d[i]));
注意要求最小值,所以要初始化
int n, l, k;
int d[510], a[510], dp[510][510];
void solve() {
cin >> n >> l >> k;
for (int i = 0; i < n; i++) cin >> d[i];
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++) dp[i][j] = inf;
dp[0][0] = 0;
d[n] = l;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
for (int x = i + 1; x <= n; x++) {
dp[x][j + 1] = min(dp[x][j + 1], dp[i][j] + a[i] * (d[x] - d[i]));
}
}
}
int ans = inf;
for (int j = n-k; j <=n; j++) {
ans = min(ans, dp[n][j]);
}
cout << ans << endl;
}
signed main() {
int T;
// T = read();
T = 1;
while (T--) {
solve();
}
return 0;
}