题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4341
转载代码:
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <sstream>
#include <fstream>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <algorithm>
#define min(x,y) (x<y?x:y)
#define max(x,y) (x>y?x:y)
#define swap(t,x,y) (t=x,x=y,y=t)
#define distance(x1,x2,y1,y2,z1,z2) (sqrt(pow(x2-x1,2)+pow(y2-y1,2)+pow(z2-z1,2)))
#define myabs(x) (x<0?-x:x)
#define sgn(x) (x<0?-1:(x>0?1:0))
#define clr(list) memset(list,0,sizeof(list))
#define maxN 205
#define maxT 40020
using namespace std;
struct point{
int x,y;
int t,value;
} P[maxN];
int dp[maxT][2];
int tr[maxT][2];
int N,T;
bool cmp(point p1,point p2)
{
if (p1.y*p2.x<p2.y*p1.x)
return 1;
if (p1.y*p2.x==p2.y*p1.x)
return p1.y<p2.y;
return 0;
}
int main()
{
int cas=0;
while (scanf("%d%d",&N,&T)==2)
{
for (int i=1;i<=N;i++)
scanf("%d%d%d%d",&P[i].x,&P[i].y,&P[i].t,&P[i].value);
sort(P+1,P+1+N,cmp);
clr(dp);
for (int i=1;i<=N;i++)
{
for (int j=0;j<=T;j++)
tr[j][0]=dp[j][0],tr[j][1]=dp[j][1];
for (int j=0;j<=T;j++)
{
if (i>1 && P[i].x*P[i-1].y==P[i].y*P[i-1].x)
{
if (j>=P[i].t && tr[j-P[i].t][1]>=0)
dp[j][1]=tr[j-P[i].t][1]+P[i].value;
else
dp[j][1]=-1;
dp[j][0]=max(tr[j][1],tr[j][0]);
}
else
{ if (j>=P[i].t)
dp[j][1]=max(tr[j-P[i].t][1],tr[j-P[i].t][0])+P[i].value;
else
dp[j][1]=-1;
dp[j][0]=max(tr[j][0],tr[j][1]);
}
}
}
int ans=0;
for (int i=1;i<=T;i++)
{
ans=max(ans,dp[i][0]);
ans=max(ans,dp[i][1]);
}
printf("Case %d: %d\n",++cas,ans);
}
return 0;
}