bzoj1649: [Usaco2006 Dec]Cow Roller Coaster

1649: [Usaco2006 Dec]Cow Roller Coaster

Time Limit: 5 Sec   Memory Limit: 64 MB
Submit: 472   Solved: 248
[ Submit][ Status][ Discuss]

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.

奶牛们正打算造一条过山车轨道．她们希望你帮忙，找出最有趣，但又符合预算的方案．  过山车的轨道由若干钢轨首尾相连，由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)．

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.

Sample Input

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

Sample Output

17
选用第3条，第5条和第6条钢轨

HINT

Source

Silver

题解：

dp.f[i][j]表示长度i,花费j的有趣最大值。

代码：

<span style="font-size:18px;">#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#define ll long long
using namespace std;
int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
struct Node{
	int x,c,w,f;
}a[10005];
int L,n,m;
ll f[1005][1005];
bool cmp(Node a,Node b)
{
	if(a.x<b.x)return true;
	else if(a.x==b.x&&a.w<b.w)return true;
	else return false;
}
int main()
{
    L=read();n=read();m=read();
    for(int i=1;i<=n;i++)
    {
    	a[i].x=read();a[i].w=read();a[i].f=read();a[i].c=read();
    }
    sort(a+1,a+1+n,cmp);
    memset(f,-1,sizeof(f));
    f[0][0]=0;
    for(int i=1;i<=n;i++)
    {
    	int e=a[i].x+a[i].w;
    	for(int j=m;j>=a[i].c;j--)
    	{
    		if(f[a[i].x][j-a[i].c]!=-1&&f[e][j]<f[a[i].x][j-a[i].c]+a[i].f)
    		f[e][j]=f[a[i].x][j-a[i].c]+a[i].f;
    	}
    }
    ll ans=-1;
    for(int i=0;i<=m;i++)
      ans=max(ans,f[L][i]);
    printf("%lld\n",ans);
}</span>