「luogu1782 」旅行商的背包

单调队列优化多重背包

要注意更新dp数组语句的位置

#include<bits/stdc++.h>
#define ll long long
#define R register
using namespace std;
const int N=20010;
int n,m,cap,v[N],w[N],d[N],a[N],b[N],c[N],ans=0,cnt[N];
ll f[N],q[N];
inline int read(){
    int x=0,w=1;char c=0;
    while(c<'0'||c>'9'){if(c=='-') w=-1;c=getchar();}
    while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+c-'0',c=getchar();
    return x*w;
}
int main(){
    int t,h,nxt;
    n=read(),m=read(),cap=read();
    for(R int i=1;i<=n;i++) v[i]=read(),w[i]=read(),d[i]=read();
    for(R int i=1;i<=m;i++) a[i]=read(),b[i]=read(),c[i]=read();
    for(R int i=1;i<=n;i++)
        for(R int j=0;j<v[i];j++)
            for(R int k=0,head=0,tail=0;k*v[i]+j<=cap;k++){
                int nxt=f[k*v[i]+j]-k*w[i];
                if(k-cnt[head]>d[i]) head++;
                while(head<tail&&q[tail-1]<nxt) tail--;
                q[tail]=nxt,cnt[tail++]=k;
                f[k*v[i]+j]=q[head]+k*w[i];
            }
    for(R int i=1;i<=m;i++)
        for(R int j=cap;j>=0;j--)
            for(R int k=0;k<=j;k++) f[j]=max(f[j],f[j-k]+a[i]*k*k+b[i]*k+c[i]);
    printf("%lld",f[cap]);
    return 0;
}