hdu 4341

这题。。。我觉得可以用double啊。。。求解释。。。

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif
/************ for topcoder by zz1215 *******************/
#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FFF(i,a)        for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b)      for( int i = (a) ; i >= (b) ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define MAX(a,b)        ((a)>(b)?(a):(b))
#define MIN(a,b)        ((a)<(b)?(a):(b))
#define read            freopen("out.txt","r",stdin)
#define write           freopen("zz.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);
const int maxn = 40011;

struct zz
{
	int x;
	int y;
	int t;
	int c;
	bool operator < (const zz & cmp ) const 
	{
		if(y*cmp.x==cmp.y*x)
		{
			return y<cmp.y;
		}
		else
		{
			return y*cmp.x<cmp.y*x;
		}
	}
}zx;

int n,t;
vector<zz>v;
vector<zz>vx;
int a[maxn];

void start()
{
	int ans=0;
	int tx=v[0].x;
	int ty=v[0].y;
	zx.c = v[0].c;
	zx.t = v[0].t;
	vx.clear();
	vx.pb(zx);
	for(int i=1;i<v.size();i++)
	{
		if(tx*v[i].y==ty*v[i].x)
		{
			zx.c+=v[i].c;
			zx.t+=v[i].t;
			vx.pb(zx);
		}
		else
		{	
			for(int k=t;k>=0;k--)
			{
				for(int j=0;j<vx.size();j++)
				{
					if(k-vx[j].t>=0)
					{
						a[k]=max(a[k],a[k-vx[j].t]+vx[j].c);
						ans=max(ans,a[k]);
					}
				}
			}
			vx.clear();
			zx.t = v[i].t;
			zx.c = v[i].c;
			vx.pb(zx);
			tx=v[i].x;
			ty=v[i].y;
		}	
	}		
	if(!vx.empty())
	{
		for(int k=t;k>=0;k--)
		{
			for(int j=0;j<vx.size();j++)
			{
				if(k-vx[j].t>=0)
				{
					a[k]=max(a[k],a[k-vx[j].t]+vx[j].c);
				}
			}
		}	
	}
	return ;
}

int main()
{		
	int tt=1;
	while(cin>>n>>t)
	{
		v.clear();
		MM(a,0);
		for(int i=1;i<=n;i++)
		{	
			SS(zx.x);
			SS(zx.y);
			SS(zx.t);
			SS(zx.c);
			v.pb(zx);
		}			
		sort(v.begin(),v.end());
		start();	
		int ans=0;
		for(int i=0;i<=t;i++)	
		{
			ans=max(ans,a[i]);
		}
		cout<<"Case "<<tt++<<": "<<ans<<endl;
	}
	return 0;
}