301765: CF333D. Characteristics of Rectangles

Memory Limit:256 MB Time Limit:3 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Characteristics of Rectangles

题意翻译

Gerald 发现一个 n 行 m 列的表格。作为一个矩形表格的杰出专家,他立刻统计了表格的信息,即表格四个角数字的最小值。但是他并没有满足于最终结果:这个值太小了。为了让它更大,他准备对表格稍加修剪:删除左右的一些列,还有上下的几行。你需要找出在这样修剪后表格上述属性(即四角数字最小值)的最大值。请注意,在修剪后,表格要至少有 2 行 2列。剪去的行和列数目可以为 0。 输入格式 第一行包含两个用空格分隔的整数 n,m(2≤n,m≤1000) 。接下来 n 行描述这个表格。这些行的第 i 行包含用空格分隔的整数 $a_{i,1}$,$a_{i,2}$,...,$a_{i,m}$ ($0<=a_{i,j}<=10^{9})$ 表示在表格第 i 行的 m 个数。 输出格式 输出问题的答案。

题目描述

Gerald found a table consisting of $ n $ rows and $ m $ columns. As a prominent expert on rectangular tables, he immediately counted the table's properties, that is, the minimum of the numbers in the corners of the table (minimum of four numbers). However, he did not like the final value — it seemed to be too small. And to make this value larger, he decided to crop the table a little: delete some columns on the left and some on the right, as well as some rows from the top and some from the bottom. Find what the maximum property of the table can be after such cropping. Note that the table should have at least two rows and at least two columns left in the end. The number of cropped rows or columns from each of the four sides can be zero.

输入输出格式

输入格式


The first line contains two space-separated integers $ n $ and $ m $ ( $ 2<=n,m<=1000 $ ). The following $ n $ lines describe the table. The $ i $ -th of these lines lists the space-separated integers $ a_{i,1},a_{i,2},...,a_{i,m} $ $ (0<=a_{i,j}<=10^{9}) $ — the $ m $ numbers standing in the $ i $ -th row of the table.

输出格式


Print the answer to the problem.

输入输出样例

输入样例 #1

2 2
1 2
3 4

输出样例 #1

1

输入样例 #2

3 3
1 0 0
0 1 1
1 0 0

输出样例 #2

0

说明

In the first test case Gerald cannot crop the table — table contains only two rows and only two columns. In the second test case if we'll crop the table, the table will contain zero in some corner cell. Also initially it contains two zeros in the corner cells, so the answer is 0.

Input

题意翻译

Gerald 发现一个 n 行 m 列的表格。作为一个矩形表格的杰出专家,他立刻统计了表格的信息,即表格四个角数字的最小值。但是他并没有满足于最终结果:这个值太小了。为了让它更大,他准备对表格稍加修剪:删除左右的一些列,还有上下的几行。你需要找出在这样修剪后表格上述属性(即四角数字最小值)的最大值。请注意,在修剪后,表格要至少有 2 行 2列。剪去的行和列数目可以为 0。 输入格式 第一行包含两个用空格分隔的整数 n,m(2≤n,m≤1000) 。接下来 n 行描述这个表格。这些行的第 i 行包含用空格分隔的整数 $a_{i,1}$,$a_{i,2}$,...,$a_{i,m}$ ($0<=a_{i,j}<=10^{9})$ 表示在表格第 i 行的 m 个数。 输出格式 输出问题的答案。

加入题单

上一题 下一题 算法标签: