Submission #49189

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
49189	2018-05-23 14:13:35	tmwilliamlin168	Luxury burrow (IZhO13_burrow)	C++14	100 / 100	550 ms	54720 KiB

burrow

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int mxN=1000;
int n, m, k, a[mxN][mxN], lb=1, rb=1e9, mb, a2, a3, b[mxN+1][mxN], l[mxN], r[mxN];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  
  cin >> n >> m >> k;
  for(int i=0; i<n; ++i)
    for(int j=0; j<m; ++j)
      cin >> a[i][j];
  while(lb<=rb) {
    mb=(lb+rb)/2, a3=0;
    for(int i=n-1; i>=0; --i)
      for(int j=0; j<m; ++j)
        b[i][j]=a[i][j]<mb?0:b[i+1][j]+1;
    for(int i=0; i<n; ++i) {
      for(int j=0; j<m; ++j) {
        l[j]=j-1;
        while(l[j]>=0&&b[i][l[j]]>=b[i][j])
          l[j]=l[l[j]];
      }
      for(int j=m-1; j>=0; --j) {
        r[j]=j+1;
        while(r[j]<m&&b[i][r[j]]>=b[i][j])
          r[j]=r[r[j]];
        a3=max(b[i][j]*(r[j]-l[j]-1), a3);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100