bzoj1649[Usaco2006 Dec]Cow Roller Coaster*

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <algorithm>
 4 #include <queue>
 5 #define inc(i,j,k) for(int i=j;i<=k;i++)
 6 #define maxn 1010
 7 #define ll long long
 8 #define INF 0x3fffffff
 9 using namespace std;
10 
11 inline int read(){
12     char ch=getchar(); int f=1,x=0;
13     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1; ch=getchar();}
14     while(ch>=‘0‘&&ch<=‘9‘)x=x*10+ch-‘0‘,ch=getchar();
15     return f*x;
16 }
17 struct nd{int w,f,c,n;}nds[maxn*10]; int g[maxn];
18 int f[maxn][maxn],l,n,b;
19 int main(){
20     l=read(); n=read(); b=read();
21     inc(i,1,n){
22         int o=read(),p=read(),q=read(),r=read(); nds[i]=(nd){p,q,r,g[o+p]}; g[o+p]=i;
23     }
24     inc(i,1,l)inc(j,0,b)f[i][j]=-INF; inc(i,0,b)f[0][i]=0;
25     inc(i,0,l){
26         inc(j,0,b){
27             for(int k=g[i];k;k=nds[k].n)
28                 if(j>=nds[k].c)f[i][j]=max(f[i][j],f[i-nds[k].w][j-nds[k].c]+nds[k].f);
29         }
30     }
31     printf("%d",f[l][b]<0?-1:f[l][b]); return 0;
32 }