1154:LETTERS

题目链接http://bailian.openjudge.cn/practice/1154/

总时间限制: 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>
 using namespace std;
 int bb[]={},s,r,sum=,s1=;
 char aa[][];
 int dir[][]={-,,,,,-,,};
 void dfs(int a,int b)
 {
     int a1,b1;
     if(s1>sum) sum=s1;           //更新最大数值
     for(int i=;i<;i++)
     {
         a1=a+dir[i][];             //用bb数组记录访问过的字母
         b1=b+dir[i][];
         if(a1>=&&a1<s&&b1>=&&b1<r&&!bb[aa[a1][b1]-'A'])
         {
             s1++;
             bb[aa[a1][b1]-'A']=;   //如果在这条单线上没有记录改字母被访问过，则总数++；
             dfs(a1,b1);             //第一个字母总要被访问，所以不用回溯；
             bb[aa[a1][b1]-'A']=;   //回溯反标记
             s1--;                   //临时记录恢复
         }
     }
 }
 int main()
 {
     cin>>s>>r;
     for(int i=;i<s;i++)
         for(int j=;j<r;j++)
         cin>>aa[i][j];
     bb[aa[][]-'A']=;
     dfs(,);
     cout<<sum<<endl;
     return ;
 }

代码二：

 #include <stdio.h>
 #include<iostream>
 using namespace std;
 int qq[][];
 int fx[]={,,-,},fy[]={,-,,},pd[],sum,ans;//右下左上
 void fun(int x,int y)
 {
     if(ans<sum)ans=sum;
     if(qq[x][y]==) return;
     for(int i=;i<;i++)
     {
         if(qq[x+fx[i]][y+fy[i]]!=&&pd[qq[x+fx[i]][y+fy[i]]]==)
         {
             sum++;
             pd[qq[x+fx[i]][y+fy[i]]]=;
             fun(x+fx[i],y+fy[i]);
             pd[qq[x+fx[i]][y+fy[i]]]=;
             sum--;
         }
     }
 }
 int main(int argc, char *argv[])
 {
     int r,s;
     scanf("%d%d",&r,&s);
     for(int i=;i<=r;i++)
         for(int j=;j<=s;j++)
            {
             char t;
             cin>>t;
             qq[i][j]=t-'A'+;
         }
     pd[qq[][]]=;
     sum=ans=;
     fun(,);
     printf("%d",ans);
     return ;
 }