# BZOJ1649: [Usaco2006 Dec]Cow Roller Coaster 背包DP

## 1649: [Usaco2006 Dec]Cow Roller Coaster

Time Limit: 5 Sec   Memory Limit: 64 MB
Submit: 584   Solved: 302

## Description

The cows are building a roller coaster! They want your help to design as fun a roller coaster as possible, while keeping to the budget. The roller coaster will be built on a long linear stretch of land of length L (1 <= L <= 1,000). The roller coaster comprises a collection of some of the N (1 <= N <= 10,000) different interchangable components. Each component i has a fixed length Wi (1 <= Wi <= L). Due to varying terrain, each component i can be only built starting at location Xi (0 <= Xi <= L-Wi). The cows want to string together various roller coaster components starting at 0 and ending at L so that the end of each component (except the last) is the start of the next component. Each component i has a "fun rating" Fi (1 <= Fi <= 1,000,000) and a cost Ci (1 <= Ci <= 1000). The total fun of the roller coster is the sum of the fun from each component used; the total cost is likewise the sum of the costs of each component used. The cows' total budget is B (1 <= B <= 1000). Help the cows determine the most fun roller coaster that they can build with their budget.

## Input

* Line 1: Three space-separated integers: L, N and B.

* Lines 2..N+1: Line i+1 contains four space-separated integers, respectively: Xi, Wi, Fi, and Ci.

第1行输入L，N，B，接下来N行，每行四个整数Xi，wi，Fi，Ci．

## Output

* Line 1: A single integer that is the maximum fun value that a roller-coaster can have while staying within the budget and meeting all the other constraints. If it is not possible to build a roller-coaster within budget, output -1.

5 6 10
0 2 20 6
2 3 5 6
0 1 2 1
1 1 1 3
1 2 5 4
3 2 10 2

17

## 题解：

f[i][j]表示， 前面 长度为i的铁路用j的成本能铺好所获取有趣指数的最大值
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#define ll long long
using namespace std;
struct Node{int s,c,w,f;}a[10005];
int L,n,mx;
ll f[1005][1005];
bool cmp(Node a,Node b)
{
if(a.s==b.s) return a.w<b.w;
return a.s<b.s;
}
int main()
{
scanf("%d%d%d",&L,&n,&mx);
for(int i=1;i<=n;i++) scanf("%d%d%d%d",&a[i].s,&a[i].w,&a[i].f,&a[i].c);
sort(a+1,a+n+1,cmp);
memset(f,-1,sizeof(f));
f[0][0]=0;
for(int i=1;i<=n;i++)
{
int e=a[i].s+a[i].w;
for(int j=mx;j>=a[i].c;j--)
if(f[a[i].s][j-a[i].c]>=0)
f[e][j]=max(f[e][j],f[a[i].s][j-a[i].c]+a[i].f);
}
ll ans=-1;
for(int i=0;i<=mx;i++) ans=max(ans,f[L][i]);
printf("%lld\n",ans);
}
//前i个位置花费为j所能获得的最大乐趣值


05-18 28
06-05 9811
12-31