HDU 5024 Wang Xifeng's Little Plot 搜索
2015-09-17 13:11
423 查看
点击打开链接
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 556 Accepted Submission(s): 362
Problem Description
《Dream of the Red Chamber》(also 《The Story of the Stone》) is one of the Four Great Classical Novels of Chinese literature, and it is commonly regarded as the best one. This novel was created in Qing Dynasty, by Cao Xueqin. But the last 40 chapters of the original
version is missing, and that part of current version was written by Gao E. There is a heart breaking story saying that after Cao Xueqin died, Cao's wife burned the last 40 chapter manuscript for heating because she was desperately poor. This story was proved
a rumor a couple of days ago because someone found several pages of the original last 40 chapters written by Cao.
In the novel, Wang Xifeng was in charge of Da Guan Yuan, where people of Jia family lived. It was mentioned in the newly recovered pages that Wang Xifeng used to arrange rooms for Jia Baoyu, Lin Daiyu, Xue Baochai and other teenagers. Because Jia Baoyu was
the most important inheritor of Jia family, and Xue Baochai was beautiful and very capable , Wang Xifeng didn't want Jia Baoyu to marry Xue Baochai, in case that Xue Baochai might take her place. So, Wang Xifeng wanted Baoyu's room and Baochai's room to be
located at two ends of a road, and this road should be as long as possible. But Baoyu was very bad at directions, and he demanded that there could be at most one turn along the road from his room to Baochai's room, and if there was a turn, that turn must be
ninety degree. There is a map of Da Guan Yuan in the novel, and redists (In China English, one whose job is studying 《Dream of the Red Chamber》is call a "redist") are always arguing about the location of Baoyu's room and Baochai's room. Now you can solve this
big problem and then become a great redist.
Input
The map of Da Guan Yuan is represented by a matrix of characters '.' and '#'. A '.' stands for a part of road, and a '#' stands for other things which one cannot step onto. When standing on a '.', one can go to adjacent '.'s through 8 directions: north, north-west,
west, south-west, south, south-east,east and north-east.
There are several test cases.
For each case, the first line is an integer N(0<N<=100) ,meaning the map is a N × N matrix.
Then the N × N matrix follows.
The input ends with N = 0.
Output
For each test case, print the maximum length of the road which Wang Xifeng could find to locate Baoyu and Baochai's rooms. A road's length is the number of '.'s it includes. It's guaranteed that for any test case, the maximum length is at least 2.
Sample Input
Sample Output
Source
2014 ACM/ICPC Asia Regional Guangzhou Online
找两个点要求相距最远,并且最多仅仅能有一个转弯。转弯必须为90度。
可以枚举每个可行点为拐点,分别求出八个方向最长距离,然后可以构成直角的两条路径相加。求最大值。
Wang Xifeng's Little Plot
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 556 Accepted Submission(s): 362
Problem Description
《Dream of the Red Chamber》(also 《The Story of the Stone》) is one of the Four Great Classical Novels of Chinese literature, and it is commonly regarded as the best one. This novel was created in Qing Dynasty, by Cao Xueqin. But the last 40 chapters of the original
version is missing, and that part of current version was written by Gao E. There is a heart breaking story saying that after Cao Xueqin died, Cao's wife burned the last 40 chapter manuscript for heating because she was desperately poor. This story was proved
a rumor a couple of days ago because someone found several pages of the original last 40 chapters written by Cao.
In the novel, Wang Xifeng was in charge of Da Guan Yuan, where people of Jia family lived. It was mentioned in the newly recovered pages that Wang Xifeng used to arrange rooms for Jia Baoyu, Lin Daiyu, Xue Baochai and other teenagers. Because Jia Baoyu was
the most important inheritor of Jia family, and Xue Baochai was beautiful and very capable , Wang Xifeng didn't want Jia Baoyu to marry Xue Baochai, in case that Xue Baochai might take her place. So, Wang Xifeng wanted Baoyu's room and Baochai's room to be
located at two ends of a road, and this road should be as long as possible. But Baoyu was very bad at directions, and he demanded that there could be at most one turn along the road from his room to Baochai's room, and if there was a turn, that turn must be
ninety degree. There is a map of Da Guan Yuan in the novel, and redists (In China English, one whose job is studying 《Dream of the Red Chamber》is call a "redist") are always arguing about the location of Baoyu's room and Baochai's room. Now you can solve this
big problem and then become a great redist.
Input
The map of Da Guan Yuan is represented by a matrix of characters '.' and '#'. A '.' stands for a part of road, and a '#' stands for other things which one cannot step onto. When standing on a '.', one can go to adjacent '.'s through 8 directions: north, north-west,
west, south-west, south, south-east,east and north-east.
There are several test cases.
For each case, the first line is an integer N(0<N<=100) ,meaning the map is a N × N matrix.
Then the N × N matrix follows.
The input ends with N = 0.
Output
For each test case, print the maximum length of the road which Wang Xifeng could find to locate Baoyu and Baochai's rooms. A road's length is the number of '.'s it includes. It's guaranteed that for any test case, the maximum length is at least 2.
Sample Input
3 #.# ##. ..# 3 ... ##. ..# 3 ... ### ..# 3 ... ##. ... 0
Sample Output
3 4 3 5
Source
2014 ACM/ICPC Asia Regional Guangzhou Online
找两个点要求相距最远,并且最多仅仅能有一个转弯。转弯必须为90度。
可以枚举每个可行点为拐点,分别求出八个方向最长距离,然后可以构成直角的两条路径相加。求最大值。
//15MS 1416K #include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int maxx,n; int dir[8][2]={{0,-1},{-1,-1},{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1}}; char g[107][107],ans[8]; void bfs(int x,int y) { memset(ans,0,sizeof(ans)); for(int i=0;i<8;i++) { int xx=x+dir[i][0]; int yy=y+dir[i][1]; while(xx<n&&xx>=0&&yy<n&&yy>=0&&g[xx][yy]=='.') {ans[i]++;xx+=dir[i][0];yy+=dir[i][1];} } for(int i=0;i<8;i++) maxx=max(maxx,ans[i]+ans[(i+2)%8]); } int main() { while(scanf("%d",&n),n) { for(int i=0;i<n;i++) scanf("%s",g[i]); maxx=0; for(int i=0;i<n;i++) for(int j=0;j<n;j++) if(g[i][j]=='.') bfs(i,j); printf("%d\n",maxx+1); } return 0; }
相关文章推荐
- HelloJSP!——configt对象和exception对象
- 90 js 强大的原型和原型链
- prototype.js的使用: 中文参数出现乱码
- js幻灯片播放器
- 后台程序弹出对话框(Reponse.Write)后css失效的解决方法
- Caffe模型读取
- js 使用正则
- Item 29:追求异常安全的代码 Effective C++笔记
- AngularJS的学习--$on、$emit和$broadcast的使用
- CSS样式表初始化代码
- js判断图片加载完成后获取图片实际宽高
- {welcome to JS} 使用多级条件(switch&case)
- JSP程序运行原理、文档结构及简单输入输出实例分析
- Javascript 中英文字符串截取
- Jsonp post 跨域方案
- JS-实现瀑布流
- js之事件冒泡和事件捕获详细介绍
- HTML之h1 h2 h3 h4标签知识经验篇
- 关于Fedora 22在虚拟机中的安装详解
- css3--text属性