蒜头君的坐骑

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<algorithm>
 5 using namespace std;
 6 int f[501][501][11],h,atk,n,m,k,a[501][501],t,ans;
 7 int cal(int x,int y,int A)
 8 {
 9     return (h-1)/A*a[x][y];
10 }
11 void dfs(int x,int y,int p,int z,int s,int A)
12 {
13     if (p>k||(x==n&&y==m))
14     {
15         f[x][y][z-1]=min(s,f[x][y][z-1]);
16         return;
17     }
18     if (x+1<=n) dfs(x+1,y,p+1,z,s+cal(x+1,y,A+a[x+1][y]),A+a[x+1][y]);
19     if (y+1<=m) dfs(x,y+1,p+1,z,s+cal(x,y+1,A+a[x][y+1]),A+a[x][y+1]);
20 }
21 int main()
22 {int i,j,l;
23     cin>>n>>m>>t>>k>>h>>atk;
24     for (i=1;i<=n;i++)
25     {
26         for (j=1;j<=m;j++)
27         {
28             scanf("%d",&a[i][j]);
29         }
30     }
31     memset(f,127/3,sizeof(f));
32     f[1][1][t]=0;
33      for (i=1;i<=n;i++)
34      {
35          for (j=1;j<=m;j++)
36          {
37              for (l=t;l>=0;l--)
38              {
39                  if (l)
40                   dfs(i,j,1,l,f[i][j][l],atk);
41                  if (i+1<=n)
42                 f[i+1][j][l]=min(f[i+1][j][l],f[i][j][l]+cal(i+1,j,atk));
43                 if (j+1<=m)
44                 f[i][j+1][l]=min(f[i][j+1][l],f[i][j][l]+cal(i,j+1,atk));
45             }
46         }
47      }
48      ans=2e9;
49      for (i=0;i<=t;i++)
50      ans=min(ans,f[n][m][i]);
51      cout<<ans;
52 }