标签：Cheese HDU blocks cheese int FatMouse location each

FatMouse and Cheese

HDU - 1078

AYIT-2021 609暑假集训第一周下 记忆化搜索和背包

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

题意：
题型：记忆化搜索
思路：

这个题未吃透，先占个位置

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,k,dp[1010][1010],map[1010][1010],to[4][2]={1,0,0,1,-1,0,0,-1};
int dfs(int x,int y)
{
	if(dp[x][y])return dp[x][y];
	int i,j,tx,ty,maxx=0;
	for(i=0;i<4;i++)
	{
		for(j=1;j<=k;j++)
		{
			tx=x+j*to[i][0];
			ty=y+j*to[i][1];
			if(tx<0||ty<0||tx>=n||ty>=n||map[tx][ty]<=map[x][y])continue;
			maxx=max(maxx,dfs(tx,ty));
		}
	}
	return dp[x][y]=maxx+map[x][y];
}
int main()
{
	int i,j;
	while(~scanf("%d%d",&n,&k)&&(n+k)!=-2)
	{
		for(i=0;i<n;i++)
			for(j=0;j<n;j++)
				scanf("%d",&map[i][j]);
		memset(dp,0,sizeof(map));
		printf("%d\n",dfs(0,0));
	}
	return 0;
}

标签：Cheese,HDU,blocks,cheese,int,FatMouse,location,each
来源： https://blog.csdn.net/weixin_52226426/article/details/119298100

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。