https://www.luogu.org/problemnew/show/P2569
总结:单调队列优化dp;没初始化i==0时,第二种情况会出错~~~;
#include<algorithm>
#include<set>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
const int maxn=2e3+9;
const int mod=1e9+7;
inline ll read()
{
ll f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9')
{
if(ss=='-')f=-1;ss=getchar();
}
while(ss>='0'&&ss<='9')
{
x=x*10+ss-'0';ss=getchar();
} return f*x;
}
deque<int>q;
int dp[2009][2009];
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
int T,MaxP,w;
cin>>T>>MaxP>>w;
for(int i=0;i<=T;i++)
{
for(int j=0;j<=MaxP;j++) dp[i][j]=-INF;
}
//mem(dp,-INF);
for(int i=1;i<=T;i++)
{
int ap,bp,as,bs;
cin>>ap>>bp>>as>>bs;
for(int j=0;j<=as;j++) dp[i][j]=-1*j*ap;
for(int j=0;j<=MaxP;j++) dp[i][j]=max(dp[i][j],dp[i-1][j]);
if(i<=w) continue;
q.clear();
for(int j=0;j<=MaxP;j++)
{
while(!q.empty()&&dp[i-w-1][q.back()]+q.back()*ap<=dp[i-w-1][j]+j*ap) q.pop_back();
q.push_back(j);
while(!q.empty()&&q.front()<j-as) q.pop_front();
if(!q.empty()) dp[i][j]=max(dp[i][j],dp[i-w-1][q.front()]+q.front()*ap-j*ap);
}
q.clear();
for(int j=MaxP;j>=0;j--)
{
while(!q.empty()&&dp[i-w-1][q.back()]+q.back()*bp<=dp[i-w-1][j]+j*bp) q.pop_back();
q.push_back(j);
while(!q.empty()&&q.front()>j+bs) q.pop_front();
if(!q.empty()) dp[i][j]=max(dp[i][j],dp[i-w-1][q.front()]+q.front()*bp-j*bp);
}
//for(int j=0;j<=MaxP;j++) cout<<dp[i][j]<<" ";
//cout<<endl;
}
int ans=0;
for(int i=0;i<=MaxP;i++) ans=max(ans,dp[T][i]);
//cout<<endl;
cout<<ans<<endl;
return 0;
}