제출 #4765

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
4765	2014-01-01 08:42:37	ainta	호화 벙커 (IZhO13_burrow)	C++98	100 / 100	384 ms	9068 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<stdio.h>
#define N_ 1010
int n, m, k, w[N_][N_], C[N_][N_], i, j, B, E, M, p[N_], st[N_][2], top, R, t, x, Res[2];
int main()
{
  scanf("%d%d%d", &n, &m, &k);
  B = 1;
  for (i = 1; i <= n; i++){
    for (j = 1; j <= m; j++){
      scanf("%d", &w[i][j]);
      if (E < w[i][j])E = w[i][j];
    }
  }
  while (B <= E){
    M = (B + E + 1) >> 1;
    R = 0;
    for (i = 1; i <= m; i++)p[i] = 0;
    for (i = 1; i <= n; i++){
      top = 0;
      for (j = 1; j <= m + 1; j++){
        if (w[i][j] < M)p[j] = i;
        x = j;
        while (top && i - p[j] <= st[top][0]){
          t = st[top][0] * (j - st[top][1]);
          if (R < t)R = t;
          x = st[top][1]; top--;
        }
        if(p[j]!=i)st[++top][0] = i - p[j], st[top][1] = x;
      }
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100