zoukankan      html  css  js  c++  java
  • LETTERS(搜索题)

    LETTERS
    Time Limit:1000MS    Memory Limit:10000KB    64bit IO Format:%I64d & %I64u
    SubmitStatus

    Description

    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.

    Input

    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.

    Output

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

    Sample Input

    3 6
    HFDFFB
    AJHGDH
    DGAGEH

    Sample Output

    6
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 using namespace std;
     5 
     6 int r, c, ans;
     7 const int move[4][2] = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}};
     8 bool VisLetter[26], VisPos[21][21];
     9 char board[21][21];
    10 
    11 bool Judge(int i, int j)
    12 {
    13     return (!VisLetter[board[i][j] - 'A'] && !VisPos[i][j] && i >= 0 && i < r && j >= 0 && j < c);
    14 }
    15 
    16 void DFS(int i, int j, int cnt)
    17 {
    18     VisLetter[board[i][j] - 'A'] = VisPos[i][j] = 1;
    19     for(int k = 0; k < 4; k++)
    20     {
    21         int ii = i + move[k][0];
    22         int jj = j + move[k][1];
    23         if(Judge(ii, jj))
    24         {
    25             DFS(ii, jj, cnt + 1);
    26             VisLetter[board[ii][jj] - 'A'] = VisPos[ii][jj] = 0;
    27         }
    28     }
    29     if(ans < cnt) ans = cnt;
    30 }
    31 
    32 int main()
    33 {
    34     while(scanf("%d %d", &r, &c) != EOF)
    35     {
    36         ans = 1;
    37         for(int i = 0; i < r; i++)
    38             scanf("%s", board[i]);
    39         memset(VisLetter, 0, sizeof(VisLetter));
    40         memset(VisPos, 0, sizeof(VisPos));
    41         DFS(0, 0, 1);
    42         printf("%d\n", ans);
    43     }
    44 }
  • 相关阅读:
    Kafka系列之-Kafka入门
    2018个人年终总结
    javascript 模块化学习:Class打包出来无法实例化问题
    [SqlServer] Error: 15023
    [Auto Testing] 工具准备:Selenium 与 ChromeDriver
    [Python] 模拟登录网站(。。为了之后操作数据。。)
    [Angular 6] 初学angular,环境全部最新,[ ng serve ] 不能启动,卡在 95% 不动 => 解决方案
    [nuget]VS中包管理器打开后找不到其它工程的问题
    当需要给<span>标签设宽度
    关于近期打算
  • 原文地址:https://www.cnblogs.com/cszlg/p/2910406.html
Copyright © 2011-2022 走看看