永州市邮编,进击的巨人第二季09,成都凯丹广场电影院
problem description
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
for each test case output in a line the single integer giving the number of blocks of cheese collected.
3 1 1 2 5 10 11 6 12 12 7 -1 -1
37
source
zhejiang university training contest 2001
we have carefully selected several similar problems for you:10801074102410811025
普通搜索会超时的 感觉这道题和滑雪（poj1088,nyoj10）一样 只不过多了一些方向
首先附上超时代码 +理解错误（he eats up the cheese where he stands and then runs either horizontally or vertically to another location.）
我要评论
#include
#include
int n,k;
int map[105][105];
bool vis[105][105];
int dir[4][2]={1,0,-1,0,0,1,0,-1};
int max;
bool limit(int x1,int y1,int x,int y)
{
if(vis[x1][y1]||x1<0||y1<0||x1>=n||y1>=n||map[x1][y1]<=map[x][y])
return false;
return true;
}
void dfs(int x,int y,int sum)
{
if(sum>max)
max=sum;
for(int i=0;in+n)
k=n+n;
for(int i=0;i理解为可以任意走k步了 wa也是应该的
记忆化搜索：
#include
#include
#include
#include
using namespace std;
int n,k,result;
int map[105][105];
int dp[105][105];
int dir[4][2]={1,0,-1,0,0,1,0,-1};
struct node
{
int x,y;
};
bool limit(int x1,int y1,int x,int y)
{
if(x1<0||y1<0||x1>=n||y1>=n||map[x1][y1]<=map[x][y])
return false;
return true;
}
int dfs(int x,int y)
{
if(dp[x][y])
return dp[x][y];
for(int i=1;i<=k;i++)
{
for(int j=0;j<4;j++)
{
int x1=x+dir[j][0]*i;
int y1=y+dir[j][1]*i;
if(limit(x1,y1,x,y))
{
int z=dfs(x1,y1);
if(dp[x][y]
如对本文有疑问，请在下面进行留言讨论，广大热心网友会与你互动！！ 点击进行留言回复
如何在没有core文件的情况下用dmesg+addr2line定位段错误
用QT制作3D点云显示器——QtDataVisualization
网友评论