HDU-1078-FatMouse and Cheese
来源:互联网 发布:淘宝卖家售后常见问题 编辑:程序博客网 时间:2024/05/22 16:39
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1078
FatMouse and Cheese
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.
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.
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 11 2 510 11 612 12 7-1 -1
Sample Output
37
题目分析:n*n的迷宫,老鼠从(1,1)出发,只可以往下或向右走,并且每次可以最多跳跃k步,要求下一次吃的奶酪一定比当前吃的多。求出最多的奶酪数。
#include<cstdio>#include<iostream>#include<cstring>#include<cmath>using namespace std;int n,k;int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};int dp[101][101],mp[101][101];bool check(int x,int y){ if(x<1||x>n||y<1||y>n) return 0; else return 1;}int dfs(int x,int y){ int ans=0; if(!dp[x][y]) { for(int j=1;j<=k;j++) { for(int i=0;i<4;i++) { int xx=x+dir[i][0]*j; int yy=y+dir[i][1]*j; if(check(xx,yy)) { if(mp[xx][yy]>mp[x][y]) ans=max(ans,dfs(xx,yy)); } else continue; } } dp[x][y]=ans+mp[x][y]; } return dp[x][y];}int main(){ while(scanf("%d%d",&n,&k)) { if(n==-1&&k==-1) break; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { scanf("%d",&mp[i][j]); } } memset(dp,0,sizeof(dp)); printf("%d\n",dfs(1,1)); } return 0;}
阅读全文
0 0
- HDU 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- hdu-1078-FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- Hdu 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- 项目管理工具之maven
- TCP三次握手的意义(目的)
- spring源码(2)Register the bean definitions(1)
- 7084:迷宫问题(dfs)
- Java_基础—IO流概述及其分类
- HDU-1078-FatMouse and Cheese
- POJ3069-贪心-Saruman's Army
- 数组的valueforkey方法
- HIbernate——事务并发问题及处理(乐观锁悲观锁)
- Spring mvc jsp/html等静态资源/Controller无法使用总结
- 记住事物的控制
- 棋盘问题-DFS
- Spring AOP详解& AspectJ表达式
- va_list、va_start、va_arg、va_end的原理与使用