题意:给出战神吕布的初始攻击力ATI、防御力DEF、生命值HP、每升一级增加的攻击力In_ATI,增加的防御力In_DEF和增加的生命值In_HP。然后给出n个敌人的攻击力、防御力、生命值和杀死该单位能获得的经验值EXP。 吕布的初始经验值EXP是0,初始等级level是1,每当EXP>=level*100时就会升级。
在吕布LvBu和敌人A之间的战斗有3条规则
1.吕布攻击A,A失去 Max(1,LvBu's ATI- A's DEF) HP;
2.A攻击吕布,吕布失去Max(1,A'ATI- LvBu'DEF)HP;
3.战斗持续到任意一方死亡
如果吕布能够将全部敌人杀死,并且自己不死,那么输出能够余下的最大HP,否则输出"Poor LvBu,his period was gone."
思路:属于状态压缩的题目,用i表示敌方的状态,dp[i]来表示杀死状态i后的最大血量
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int dp[1<<20];
int A[30],D[30],H[30],E[30];
char temp[100];
int ATI,DEF,HP,IN_ATI,IN_DEF,IN_HP;
int main(){
while (scanf("%d%d%d%d%d%d",&ATI,&DEF,&HP,&IN_ATI,&IN_DEF,&IN_HP) != EOF){
int n;
scanf("%d",&n);
for (int i = 0; i < n; i++)
scanf("%s%d%d%d%d",temp,&A[i],&D[i],&H[i],&E[i]);
memset(dp,0,sizeof(dp));
dp[0] = HP;
for (int i = 0; i < 1<<n; i++){
if (dp[i] <= 0)
continue;
int exp = 0;
for (int j = 0; j < n; j++)
if (i & (1<<j))
exp += E[j];
int levup = exp/100;
int ati = ATI + levup*IN_ATI;
int def = DEF + levup*IN_DEF;
levup++;
for (int j = 0; j < n; j++){
if (i & (1<<j))
continue;
int inj = max(1,ati-D[j]);
int t = H[j] / inj;
if (H[j] % inj)
t++;
int lost = (t-1) * max(1,A[j]-def);
if (lost >= dp[i])
continue;
int curhp = dp[i] - lost;
if (exp+E[j] >= levup*100)
curhp += IN_HP;
int st = i + (1<<j);
if (curhp > dp[st])
dp[st] = curhp;
}
}
if (dp[(1<<n)-1] <= 0)
printf("Poor LvBu,his period was gone.\n");
else printf("%d\n",dp[(1<<n)-1]);
}
return 0;
}