题目:
FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At each grid location Fatmouse has hid between 0 and 100 blocks of cheese in a hole. Now he’s going to enjoy his favorite food.
FatMouse begins by standing at location (0,0). He eats up the cheese where he stands and then runs either horizontally or vertically to another location. The problem is that there is a super Cat named Top Killer sitting near his hole, so each time he can run at most k locations to get into the hole before being caught by Top Killer. What is worse – after eating up the cheese at one location, FatMouse gets fatter. So in order to gain enough energy for his next run, he has to run to a location which have more blocks of cheese than those that were at the current hole.
Given n, k, and the number of blocks of cheese at each grid location, compute the maximum amount of cheese FatMouse can eat before being unable to move.
Input
There are several test cases. Each test case consists of
a line containing two integers between 1 and 100: n and k
n lines, each with n numbers: the first line contains the number of blocks of cheese at locations (0,0) (0,1) … (0,n-1); the next line contains the number of blocks of cheese at locations (1,0), (1,1), … (1,n-1), and so on.
The input ends with a pair of -1’s.
Output
For each test case output in a line the single integer giving the number of blocks of cheese collected.
Sample Input
3 1
1 2 5
10 11 6
12 12 7
-1 -1
Sample Output
37
题目大意
在一个n*n的矩阵里每一点有一定数量的奶酪,你每次离开这一点最多走k步,而且必须要走到奶酪比前一个多的才行,问你最多能吃多少奶酪。
思路:
典型的记忆化搜索题目
dp[i]:从i点开始可以吃到的最大数奶酪
每次搜索到i点时如果dp[i]不为0就返回,此处为剪枝
#include<string.h>
#include<algorithm>
using namespace std;
int n,k;
int net[4][2]={-1,0,0,1,1,0,0,-1};
int dp[110][110];
int a[110][110];
int dfs(int x,int y)
{
int maxx,i,j,tx,ty,ans;
maxx=0;
if(dp[x][y]!=0) return dp[x][y];
for(i=0;i<4;i++)
{
for(j=1;j<=k;j++)
{
tx=x+net[i][0]*j;
ty=y+net[i][1]*j;
if(tx<0||tx>=n||ty<0||ty>=n||a[tx][ty]<=a[x][y]) continue;
ans=dfs(tx,ty);
maxx=max(maxx,ans);
}
}
dp[x][y]=a[x][y]+maxx;
return dp[x][y];
}
int main()
{
int i,j;
while(~scanf("%d %d",&n,&k))
{
if(n==-1&&k==-1) break;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
}
memset(dp,0,sizeof(dp));
printf("%d\n",dfs(0,0));
}
return 0;
}
在这里插入代码片