省赛 Plumbing the depth of lake
来源:互联网 发布:数据库接口怎么写 编辑:程序博客网 时间:2024/06/05 08:09
题目描述
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.
样例输入
14 30 1 01 2 01 5 12 3 4
样例输出
1
本题题意:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <string>using namespace std;int dx[8]={1,1,-1,-1,0,0,1,-1};///定义其八个方向int dy[8]={0,1,0,-1,1,-1,-1,1};///定义其八个方向int map[55][55];int main(){ int T,M,N,i,j,k; scanf("%d",&T); while(T--) { int maxx=-1; memset(map,-1,sizeof(map)); scanf("%d%d",&M,&N); for(i=1; i<=M; i++) { for(j=1; j<=N; j++) { scanf("%d",&map[i][j]); } } for(i=1; i<=M; i++) { for(j=1; j<=N; j++) { if(maxx>map[i][j]) continue; for(k=0; k<8; k++) { if(map[i][j]==map[i+dx[k]][j+dy[k]]) maxx=map[i][j]; } } } printf("%d\n",maxx); }}
- 省赛 Plumbing the depth of lake
- 第十届ACM省赛-E Plumbing the depth of lake
- 问题 G: Plumbing the depth of lake
- 河南省第十届ACM省赛G:Plumbing the depth of lake
- 2017年河南省ACM省赛 Problem G: Plumbing the depth of lake
- G Plumbing the depth of lake 河南第十届ACM真题 【搜索】
- 河南省第十届ACM省赛题目:问题 G: Plumbing the depth of lake
- 校OJ 10536: the depth of lake ---搜索
- 西湖十景(Ten Views of the West Lake)
- 【JS】There’s Nostalgia in the Waters of Lake.js
- The Phantom of the Opera-9、The house on the lake
- Count the depth of the stack in JVM.
- Lake Of Tears
- Lake Of Autumn
- by the lake
- the lake house
- [2010-VLDB] The Performance of MapReduce: An In-depth Study
- The first in-depth technical analysis of VP8
- 4.11easyui
- 2017山东省赛 Fireworks
- LeedCode 之 Integer to Roman
- 23种设计模式(概念、原则、场景、优点、缺点、应用)简述
- freeRTOS 在 BlackFin533 平台上的移植 (1)
- 省赛 Plumbing the depth of lake
- 516. Longest Palindromic Subsequence Medium
- 【IApplication】基于MVP+Dagger2+Retrofit+Rxjava框架之IApplication
- 开关按钮(ToggleButton)与开关(Switch)的功能与用法
- php面试题
- 计算机(SoC)系统启动的比较与分析
- u3d的3dText一直正面显示的方法:让用户看不到反面的文字
- 深度学习的发展历程
- linux(centos)用户与权限