题目
求小pp能撑过的天数和最多的钱数。
分析
dp
f
[
i
]
[
j
]
[
k
]
[
p
]
[
d
]
f[i][j][k][p][d]
f[i][j][k][p][d]表示第
i
i
i天第一种矿泉水的喜爱度为
j
j
j(后面同理)时剩下的钱数。
f
[
i
]
[
j
]
[
k
]
[
p
]
[
d
]
=
m
i
n
(
f
[
i
−
1
]
[
j
+
1
]
[
k
+
1
]
[
p
+
1
]
[
d
+
1
]
,
f
[
i
−
1
]
[
x
[
1
]
]
[
k
+
1
]
[
p
+
1
]
[
d
+
1
]
,
f
[
i
−
1
]
[
j
+
1
]
[
x
[
2
]
]
[
p
+
1
]
[
d
+
1
]
,
f
[
i
−
1
]
[
j
+
1
]
[
k
+
1
]
[
x
[
3
]
]
[
d
+
1
]
,
f
[
i
−
1
]
[
j
+
1
]
[
k
+
1
]
[
p
+
1
]
[
x
[
4
]
]
)
f[i][j][k][p][d]=min( f[i-1][j+1][k+1][p+1][d+1],f[i-1][x[1]][k+1][p+1][d+1],f[i-1][j+1][x[2]][p+1][d+1],f[i-1][j+1][k+1][x[3]][d+1],f[i-1][j+1][k+1][p+1][x[4]])
f[i][j][k][p][d]=min(f[i−1][j+1][k+1][p+1][d+1],f[i−1][x[1]][k+1][p+1][d+1],f[i−1][j+1][x[2]][p+1][d+1],f[i−1][j+1][k+1][x[3]][d+1],f[i−1][j+1][k+1][p+1][x[4]])
代码
#include <cstdio>
#include <cctype>
#include <cstring>
#include <climits>
using namespace std;
int x[5],y[5],n,m,q,tot,ans,f[1001][10][10][10][10];
int in(){
int ans=0; char c=getchar();
while (!isdigit(c)) c=getchar();
while (isdigit(c)) ans=ans*10+c-48,c=getchar();
return ans;
}
int main(){
n=in(); m=in(); q=in(); memset(f,-127/3,sizeof(f));
for (int i=1;i<=n;i++) x[i]=in();
for (int i=n+1;i<=4;i++) x[i]=9;
for (int i=1;i<=n;i++) y[i]=in();
f[0][x[1]][x[2]][x[3]][x[4]]=q;//一开始为q元
for (int i=0;i<m;i++)
for (int j=1;j<=x[1];j++)
for (int k=1;k<=x[2];k++)
for (int p=1;p<=x[3];p++)
for (int d=1;d<=x[4];d++){
int t=f[i][j][k][p][d];
if (t>f[i+1][j-1][k-1][p-1][d-1]) f[i+1][j-1][k-1][p-1][d-1]=t;//不喝
if (t-y[1]>f[i+1][x[1]][k-1][p-1][d-1]) f[i+1][x[1]][k-1][p-1][d-1]=t-y[1];//喝第一种
if (t-y[2]>f[i+1][j-1][x[2]][p-1][d-1]) f[i+1][j-1][x[2]][p-1][d-1]=t-y[2];//喝第二种
if (t-y[3]>f[i+1][j-1][k-1][x[3]][d-1]) f[i+1][j-1][k-1][x[3]][d-1]=t-y[3];//喝第三种
if (t-y[4]>f[i+1][j-1][k-1][p-1][x[4]]) f[i+1][j-1][k-1][p-1][x[4]]=t-y[4];//喝第四种
if (t>=0) ans=i;//
}
if (ans==m-1) puts("+oo");//可以永生 else printf("%d\n",ans);//可以活多少天
for (int i=1;i<=x[1];i++)
for (int j=1;j<=x[2];j++)
for (int k=1;k<=x[3];k++)
for (int p=1;p<=x[4];p++) tot=(tot>f[ans][i][j][k][p])?tot:f[ans][i][j][k][p];//找最大值
printf("%d",tot);
return 0;
}