2.5基本算法之搜索 AK代码~+题解

2.5基本算法之搜索 156:LETTERS

总时间限制: 1000ms 内存限制: 65536kB

描述

A single-player game is played on a rectangular board divided in R rows and C columns. There is a single uppercase letter (A-Z) written in every position in the board.
Before the begging of the game there is a figure in the upper-left corner of the board (first row, first column). In every move, a player can move the figure to the one of the adjacent positions (up, down,left or right). Only constraint is that a figure cannot visit a position marked with the same letter twice.
The goal of the game is to play as many moves as possible.
Write a program that will calculate the maximal number of positions in the board the figure can visit in a single game.

输入

The first line of the input contains two integers R and C, separated by a single blank character, 1 <= R, S <= 20.
The following R lines contain S characters each. Each line represents one row in the board.

输出

The first and only line of the output should contain the maximal number of position in the board the figure can visit.

样例输入
3 6
HFDFFB
AJHGDH
DGAGEH

样例输出
6

来源
Croatia OI 2002 Regional Competition - Juniors

解题关键:
使用搜索与回溯，递归（自己调用自己）。

参考代码：

#include<iostream>
#include<cstdio>
using namespace std;
char a[21][21