hdu1208(记忆优化)

很简单的一道题记忆搜索水过

#define  _CRT_SECURE_NO_WARNINGS
/*
* this code is made by LinMeiChen
* Problem:
* Type of Problem:
* Thinking:
* Feeling:
*/
#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<string.h>
#include<stdio.h>
#include<math.h>
#include<string>
#include<vector>
#include<queue>
#include<list>
using namespace std;
typedef __int64 lld;
typedef unsigned int ud;
#define oo 0x3f3f3f3f
#define maxn 36
lld dp[maxn][maxn];
char buff[maxn];
int map[maxn][maxn];
int n;

lld Dp(int x, int y)
{
	if (dp[x][y] != -1)
		return dp[x][y];
	dp[x][y] = 0;
	if (x + map[x][y] <= n)
		dp[x][y] += Dp(x + map[x][y], y);
	if (y + map[x][y] <= n)
		dp[x][y] += Dp(x, y + map[x][y]);
	return dp[x][y];
}

int main()
{
	while (scanf("%d", &n) && n != -1)
	{
		memset(dp, -1, sizeof dp);
		for (int i = 1; i <= n; i++)
		{
			scanf("%s", buff + 1);
			for (int j = 1; j <= n; j++)
				map[i][j] = buff[j] - '0';
		}
		dp[n][n] = 1;
		printf("%I64d\n", Dp(1, 1));
	}
	return 0;
}