P2854 [USACO06DEC]牛的过山车Cow Roller Coaster

题目描述
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.
奶牛们正打算造一条过山车轨道．她们希望你帮忙，找出最有趣，但又符合预算 的方案． 过山车的轨道由若干钢轨首尾相连，由x=0处一直延伸到X=L(1≤L≤1000)处．现有N(1≤N≤10000)根钢轨，每根钢轨的起点 Xi(0≤Xi≤L- Wi)，长度wi(l≤Wi≤L)，有趣指数Fi(1≤Fi≤1000000)，成本Ci(l≤Ci≤1000)均己知．请确定一 种最优方案，使得选用的钢轨的有趣指数之和最大，同时成本之和不超过B(1≤B≤1000)．
输入格式
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.
输出格式
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.
输入输出样例
输入 #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
输出 #1复制
17
说明/提示
Taking the 3rd, 5th and 6th components gives a connected roller-coaster with fun value 17 and cost 7. Taking the first two components would give a more fun roller-coaster (25) but would be over budget.

【分析】
还是大体能看出是个DP。

核心是这幅图。
f数组：最大的趣味值
f[j][k]：j表示当前已铺设到的长度，k表示已用的成本
于是找到一根以j为结尾的铁轨后，可得f[j][k] = max(f[j][k], f[j-w[i]][k-c[i]])

需要注意的问题：
1.采用正向填表的方法会更简单
2.注意所有铁轨必须根据位置进行排序
3.注意初始值，由于某些位置是无法铺设铁轨的，所以在迭代时，这些不存在的状态我们应该设为-INF，避免影响到答案，f[0][0] = 0是第一个有效状态。

【AC代码】

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int f[2039][2039];
int L, N, B, ans;
int max(int a, int b){return a>b?a:b;}
struct FLY{
	int x, w, f, c;
}a[10039];
int cmp(FLY a, FLY b){
	if(a.x<b.x)return 1;
	else return 0;
}
int main(){
	//freopen("1.in", "r", stdin);
	scanf("%d%d%d", &L, &N, &B);
	for(int i = 1; i < N+1; i++)scanf("%d%d%d%d", &a[i].x, &a[i].w, &a[i].f, &a[i].c);
	sort(a+1, a+1+N, cmp);
	memset(f, 0x80, sizeof(f));
	f[0][0] = 0;
	for(int i = 0; i < N; i++)
		for(int k = 0; k < B-a[i+1].c+1; k++)
			f[a[i+1].x+a[i+1].w][k+a[i+1].c] = max(f[a[i+1].x+a[i+1].w][k+a[i+1].c], f[a[i+1].x][k]+a[i+1].f);
	for(int i = 0; i < B+1; i++)
		ans = max(ans, f[L][i]);
	printf("%d", !ans?-1:ans);
	return 0;
}