A题代码，需稍作改动

常规
1

#include <bits/stdc++.h>
#define sc scanf
#define pr printf
#define ll long long
//#pragma GCC optimize(1000)
//#pragma GCC optimize(“Ofast”)
//#pragma GCC optimize(“inline”)
//#pragma GCC optimize(“-fgcse”)
//#pragma GCC optimize(“-fgcse-lm”)
//#pragma GCC optimize(“-fipa-sra”)
//#pragma GCC optimize(“-ftree-pre”)
//#pragma GCC optimize(“-ftree-vrp”)
//#pragma GCC optimize(“-fpeephole2”)
//#pragma GCC optimize(“-ffast-math”)
//#pragma GCC optimize(“-fsched-spec”)
//#pragma GCC optimize(“unroll-loops”)
//#pragma GCC optimize(“-falign-jumps”)
//#pragma GCC optimize(“-falign-loops”)
//#pragma GCC optimize(“-falign-labels”)
//#pragma GCC optimize(“-fdevirtualize”)
//#pragma GCC optimize(“-fcaller-saves”)
//#pragma GCC optimize(“-fcrossjumping”)
//#pragma GCC optimize(“-fthread-jumps”)
//#pragma GCC optimize(“-funroll-loops”)
//#pragma GCC optimize(“-freorder-blocks”)
//#pragma GCC optimize(“-fschedule-insns”)
//#pragma GCC optimize(“inline-functions”)
//#pragma GCC optimize(“-ftree-tail-merge”)
//#pragma GCC optimize(“-fschedule-insns2”)
//#pragma GCC optimize(“-fstrict-aliasing”)
//#pragma GCC optimize(“-falign-functions”)
//#pragma GCC optimize(“-fcse-follow-jumps”)
//#pragma GCC optimize(“-fsched-interblock”)
//#pragma GCC optimize(“-fpartial-inlining”)
//#pragma GCC optimize(“no-stack-protector”)
//#pragma GCC optimize(“-freorder-functions”)
//#pragma GCC optimize(“-findirect-inlining”)
//#pragma GCC optimize(“-fhoist-adjacent-loads”)
//#pragma GCC optimize(“-frerun-cse-after-loop”)
//#pragma GCC optimize(“inline-small-functions”)
//#pragma GCC optimize(“-finline-small-functions”)
//#pragma GCC optimize(“-ftree-switch-conversion”)
//#pragma GCC optimize(“-foptimize-sibling-calls”)
//#pragma GCC optimize(“-fexpensive-optimizations”)
//#pragma GCC optimize(“inline-functions-called-once”)
//#pragma GCC optimize(“-fdelete-null-pointer-checks”)
using namespace std;
int n,h,t,p[205],d[205],c[205];
int dp[205][605],maxn;
int main()
{
// freopen(“1.txt”,“r”,stdin);
sc(“%d%d%d”,&n,&h,&t);
h*=60;
for(int i=1; i <= n; i++)
{
sc(“%d%d%d”,&p[i],&d[i],&c[i]);
}
for(int i=0; i <= 204; i++)
{
for(int j=0; j <= 604; j++)
{
dp[i][j]=INT_MIN;
}
}
// for(int i=1; i <= n; i++)
// {
// dp[i][h]=0;
// }
for(int i=1; i <= n; i++)
{
dp[i][h]=0;
for(int j=1; jt<= h;j++)
{
dp[i][h-tj]=max(dp[i][h-tj],(2p[i]-d[i](j-1))j/2);
// maxn=max(maxn,dp[i][h-tj]);
}
}
for(int i=1; i <= n;i++)
{
for(int j=h; j >= 0; j–)
{
for(int k=0; j+tk+c[i-1]<=h; k++)
{
dp[i][j]=max(dp[i-1][j+t*k+c[i-1]]+(p[i]2-d[i](k-1))*k/2,dp[i][j]);
maxn=max(maxn,dp[i][j]);
}
}
}
// cout << dp[1][40]<<endl<<dp[2][30]<<endl<<dp[2][31]<<endl;
pr(“%d”,maxn);
return 0;
}

2

这不叫坑人，这叫为他人提供经验

3

加一个特判就行

4

6的嘞