河南省第十届ACM省赛G:Plumbing the depth of lake
2017-05-21 21:36
357 查看
Plumbing the depth of lake
题目描述There is a mysterious lake in the north of Tibet. As the sun shines, the surface of the lake is colorful and colorful. The lake was unfathomable in rainy weather. After the probe, It has an interesting bottom in that it is full of little hills and valleys. . Scientists wonders how deep the bottom of the lake is.
Scientists use the most advanced radar equipment to detect the bottom of the lake. It is the discovery that the deepest part is relatively flat. Thet want to know the largest depth number only if it is verified by the fact that the same depth appears in an adjacent reading.
To facilitate computing, scientists have put the lake as M * N grids . The depth reading of each grid is already known. some readings might be 0– It’s a small island on the lake.
Find the greatest depth that appears in at least two ‘adjacent’readings (where ‘adjacent’ means in any of the potentially eight squares that border a square on each of its sides and its diagonals). The lake has at least one pair of positive, adjacent readings.
输入
The first line of the input contains one integers T, which is the nember of test cases (1<=T<=5). Each test case specifies:
Line 1: Two space-separated integers: M and N (1 ≤ M, N ≤ 50)
Lines 2..M+1: Line i+1 contains N space-separated integers that represent the depth of the lake across row i: Dij (0 <= Dij <=1,000,000);
输出
For each test case generate a single line: a single integer that is the depth of the lake determined.
样例输入
1
4 3
0 1 0
1 2 0
1 5 1
2 3 4
样例输出
1
搜索题
#include<stdio.h> #include<string.h> int dx[]={-1,-1,-1,0,0,1,1,1}; int dy[]={-1,0,1,-1,1,-1,0,1}; int main() { int n,m,l; int a[55][55]; scanf("%d",&l); while(l--) { scanf("%d %d",&n,&m); memset(a,-1,sizeof< 4000 /span>(a)); for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { scanf("%d",&a[i][j]); } } int maxx=-9999; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { if(maxx>=a[i][j]) continue; for(int k=0;k<8;k++) { if(a[i][j]==a[dx[k]+i][dy[k]+j]) { maxx=a[i][j]; break; } } } } printf("%d\n",maxx); } return 0; }
相关文章推荐
- 2017年河南省ACM省赛 Problem G: Plumbing the depth of lake
- 第十届ACM省赛-E Plumbing the depth of lake
- 河南省第十届ACM省赛题目:问题 G: Plumbing the depth of lake
- G Plumbing the depth of lake 河南第十届ACM真题 【搜索】
- 省赛 Plumbing the depth of lake
- 问题 G: Plumbing the depth of lake
- 山东省第八届ACM省赛A.Return of the Nim
- 2013山东省第四届ACM省赛 The number of steps
- 山东省第八届acm省赛 Return of the Nim
- 河南省第十届acm省赛-谍报分析——个人c++解
- (关系幂运算->n长度的最短路)河南省第十届ACM省赛题目:问题 I: Transmit information
- 第八届河南省ACM省赛 - B - 最大岛屿
- hdu 4727 The Number Off of FFF 简单题( 2013 ACM/ICPC Asia Regional Online —— Warmup2 1012)
- [河南省ACM省赛-第五届] 试制品 (nyoj 542)
- 【2017 ACM/ICPC Asia Regional Qingdao Online 1003】hdu 6208 The Dominator of Strings
- 杭电ACM 1010 Tempter of the Bone
- nyoj1278 zzuli1929 Prototypes analyze(河南省acm第九届省赛)
- ACM-水题 Demacia of the Ancients
- 引水工程 河南省ACM2015年省赛D 题(最小生成树)
- 河南第十届ACM省赛-I-Transmit information