P1977 出租车拼车

https://www.luogu.com.cn/problem/P1977

---

模拟,动态规划

---

黄色题

---

思路:

f[i][j]表示前i辆车走了j个OIer 

f[i][j]=min(f[i-1][j-k]+k*t[i]+d,f[i][j])(1<=k<=min(j,z[i]))

---

#include<iostream>
#include<cstring>
#define maxn 101
using namespace std;
int n,k,d,s,f[maxn][maxn];
struct node{
    int t,z;
}a[maxn];
int main(){
    memset(f,10,sizeof(f));
    cin>>n>>k>>d>>s;
    for(int i=1;i<=n;i++)cin>>a[i].t>>a[i].z;
    f[0][0]=0;
    for(int i=1;i<=k;i++)
        for(int j=0;j<=n;j++){
            f[i][j]=f[i-1][j];
            for(int k=0;k<=min(j,a[i].z);k++)
                f[i][j]=min(f[i-1][j-k]+k*a[i].t+d,f[i][j]);
        }
    if(f[k][n]>=10000)cout<<"impossible";
    else cout<<f[k][n];
    return 0;
}