HDU1078 dfs+dp
来源:互联网 发布:人工智能基础 知乎 编辑:程序博客网 时间:2024/05/22 02:12
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
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
第一次dfs+dp
稍微有点蒙…
按照dp思想一开始强行状态转移…
疯狂tle
后来想想也对
我更新每一个值….
2^n的复杂度
数据量一万
那不是找死么…
后来还是选择了这种dfs+dp的方式
把每条路径里最大的那条转移了状态就可以了
#include<iostream>#include<cmath>#include<algorithm>#include<cstdio>#include<string>using namespace std;int zhi[101][101];int dp[101][101];int n, k;int sum;int dfs(int a, int b){ int sum = 0; int x = a, y = b; if (dp[a][b]==0) { for (int c = -k;c <= k;c++) { if (k==0)continue; if (x + c >= 1 && x + c <= n&&zhi[x + c][y] > zhi[x][y])sum = max(sum, dfs(x + c, y)); if (y + c >= 1 && y + c <= n&&zhi[x][y + c] > zhi[x][y])sum = max(sum, dfs(x, y + c)); } dp[x][y] = sum+zhi[x][y]; return dp[x][y]; } else return dp[x][y];}int main(){ while (cin >> n >> k) { if (n == -1)break; sum = 0; memset(dp, 0, sizeof(dp)); memset(zhi, 0, sizeof(zhi)); for (int a = 1;a <= n;a++)for (int b = 1;b <= n;b++)scanf("%d", &zhi[a][b]); cout <<dfs(1,1) << endl; } return 0;}
- HDU1078(树形DP+DFS)
- HDU1078 dfs+dp
- hdu1078(dp+dfs)
- HDU1078 记忆化DFS+dp
- HDU1078:记忆搜索(dp+dfs)
- HDU1078 FatMouse and Cheese(DFS+DP)
- hdu1078 FatMouse and Cheese 搜索dfs&dp
- HDU1078(深搜+DP)
- hdu1078基础dp
- hdu1078
- hdu1078
- hdu1078
- HDU1078
- HDU1078
- hdu1078
- HDU1078
- hdu1078 zoj1107(记忆化搜索/DP)
- HDU1078 FatMouse and Cheese(DP&非DP)
- 15分钟学会使用Git和远程代码库
- 电话监听和调用挂断电话
- Android Studio 调试出现waiting for debugger的解决办法
- 优化你的APP--Android内存优化(一)
- 使用myeclipse构建maven项目报错:No goals have been specified for this build
- HDU1078 dfs+dp
- Caffe学习笔记1:初识caffe篇(caffe介绍)
- VS2010/MFC编程入门之五(MFC消息映射机制概述)
- Git+GPG加密tag一直失败
- Android Studio项目整合PullToRefresh的问题记录
- 手动处理ScrollToTop
- python之面向对象编程
- Unity 5 中的全局光照技术详解(建议收藏)
- 树-堆结构练习——合并果子之哈夫曼树