hdu1078FatMouse and Cheese

 题目链接：hdu1078

代码：dfs

// each time he can run at most k locations to get into the hole before being caught by Top Killer. //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. // two integers between 1 and 100: n and k #include <iostream> using namespace std; int move[4][2]={-1,0,0,-1,1,0,0,1}; //移动方向，随便 int a[105][105],value[105][105]; int n,k; int dfs(int i,int j) { if(value[i][j]!=-1)return value[i][j]; int x,y,s,t,max=0,temp; for(s=1;s<=k;s++) { for(t=0;t<4;t++) { x=i+s*move[t][0]; y=j+s*move[t][1]; if(x<0||y<0||x>=n||y>=n||a[x][y]<=a[i][j])continue; //如果越界或者跳到的下一个地方的奶酪少于该地方的奶酪量就继续搜索 temp=dfs(x,y); if(temp>max)max=temp; //找到一个吃到奶酪数量更多的就把它存起来 } } value[i][j]=a[i][j]+max; return value[i][j]; } int main(int argc, char *argv[]) { while(cin>>n>>k) { if(n==-1&&k==-1)break; int i,j; for(i=0;i<n;i++) for(j=0;j<n;j++){ cin>>a[i][j];value[i][j]=-1;} cout<<dfs(0,0)<<endl; } //system("pause"); return 0; }