队列 太空梯 Poj2392 中等

Description

The cows are going to space! They plan to achieve orbit by building a sort of space elevator: a giant tower of blocks. They have K (1 <= K <= 400) different types of blocks with which to build the tower. Each block of type i has height h_i (1 <= h_i <= 100) and is available in quantity c_i (1 <= c_i <= 10). Due to possible damage caused by cosmic rays, no part of a block of type i can exceed a maximum altitude a_i (1 <= a_i <= 40000).

Help the cows build the tallest space elevator possible by stacking blocks on top of each other according to the rules.
Input

• Line 1: A single integer, K

• Lines 2…K+1: Each line contains three space-separated integers: h_i, a_i, and c_i. Line i+1 describes block type i.
  Output

• Line 1: A single integer H, the maximum height of a tower that can be built

解题思路：
代码：

#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
# define MAXV 410
# define MAXM 40010

typedef struct
{
	int h,a,c;
}blocks;

blocks v[MAXV];

int cmp(blocks x,blocks y)
{
	return x.a<y.a;
}
int f[MAXM],user[MAXM];

int main()
{
	int i,j,t,Max;
	scanf("%d",&t);
	for(i=1;i<=t;i++)
	{
		scanf("%d%d%d",&v[i].h,&v[i].a,&v[i].c);
	}	
	sort(v+1,v+t+1,cmp); 
	memset(f,0,sizeof(f)); 
	f[0]=1;
	Max=0;
	for(i=1;i<=t;i++)
	{
		memset(user,0,sizeof(user));
		for(j=v[i].h;j<=v[i].a;j++)
		if(!f[j]&&f[j-v[i].h]&&user[j-v[i].h]+1<=v[i].c)
		{
			f[j]=1;
			user[i]=user[j-v[i].h]+1;
			if(j>Max)
			Max=j;
		}
	 } 
		printf("%d",Max);
	return 0;
}

PS：本博客属于中国石油大学胜利学院ACM协会所有！
BY：李雅琪