poj1154 连通分量 简单深搜
来源:互联网 发布:php 返回 服务器404 编辑:程序博客网 时间:2024/06/04 23:34
LETTERS
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8031 Accepted: 3625
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.
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.
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 6HFDFFBAJHGDHDGAGEH
Sample Output
6
题意很简单:就是在一个矩形的字符阵中寻找一个没有重复的的字符的字符序列,方向只有四个方向,求这个序列字符个数
解题思路:从每一个位置开始搜索一下,在每一个位置递归进去,运用回溯就可以满足了
然后实现代码,其实很简单,可以和我的另外一篇blog对比一下http://blog.csdn.net/summer__show_/article/details/51146603
都是连通分量求最大值
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int R,C;char visit[25][25];int temp[100];int dx[]={0,0,1,-1};int dy[]={1,-1,0,0};int ans,coun;int dfs(int x,int y){ for(int i=0;i<4;i++){ int tempx=x+dx[i]; int tempy=y+dy[i]; if(tempx>=0&&tempy>=0&&tempx<R&&tempy<C&&temp[visit[tempx][tempy]]==0){ temp[visit[tempx][tempy]]=1; coun++; dfs(tempx,tempy); ans=max(ans,coun); temp[visit[tempx][tempy]]=0;//回溯 coun--; } }}int main(){ while(scanf("%d%d",&R,&C)!=EOF) { getchar(); for(int i=0;i<R;i++) scanf("%s",visit[i]); memset(temp,0,sizeof(temp)); ans=coun=1; temp[visit[0][0]]=1; dfs(0,0); printf("%d\n",ans); } return 0;}
0 0
- poj1154 连通分量 简单深搜
- poj 3620 简单深搜 连通分量
- hdu1269 迷宫城堡 (简单强连通分量)
- poj1154
- POJ1154
- POJ1154
- POJ 3620 Avoid The Lakes(简单DFS求连通分量)
- [BFS][连通分量]求连通分量
- 连通图和连通分量
- 收缩强连通分量
- 强连通分量
- 来个强连通分量的
- POJ2181强连通分量
- 强连通分量模板
- POJ_2762_强连通分量
- 强连通分量
- 强连通分量
- 强连通分量
- ganglia安装
- 微软框架集合
- 如何用vs2015编译与使用libtomcrypt
- 关于Objective - C
- Jackson 框架,轻易转换JSON
- poj1154 连通分量 简单深搜
- 万能的NSData各种数据类型之间的转化
- 自定义构造方法和description方法
- python从文件读数据
- 关于Android Studio升级到2.0后和Gradle插件不兼容的问题
- Unity中NGUI里ScrollView选中的item遮挡自动滚动到中间或者合适位置
- 关于原码、反码、补码
- json截取的字符串在highchart中不能用的问题解决
- JAVA多线程与并发学习总结