제출 #204146

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
204146	2020-02-24 16:01:00	Kalam	호화 벙커 (IZhO13_burrow)	C++11	100 / 100	587 ms	18568 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
// KALAM
# include<bits/stdc++.h>
using namespace std;
const int N = 1000 + 77;
int n , m , k , a[N][N] , b[N][N] , c[N] , L[N] , R[N];
inline int Solve() {
   int res = 0;
   for(int i = 1;i <= m;++ i) {
      L[i] = i - 1;
      while(c[L[i]] >= c[i] && L[i] > 0)
         L[i] = L[L[i]];
   }
   for(int i = m;i > 0;-- i) {
      R[i] = i + 1;
      while(c[R[i]] >= c[i] && R[i] <= m)
         R[i] = R[R[i]];
      res = max(res , (R[i] - L[i] - 1) * c[i]);
   }
   return res;
}
inline int Check(int t) {
   int res = 0;
   for(int i = 1;i <= n;++ i) {
      for(int j = 1;j <= m;++ j)
         b[i][j] = (a[i][j] >= t ? 1 + b[i - 1][j] : 0);
      for(int j = 1;j <= m;++ j)
         c[j] = b[i][j];
      res = max(res , Solve());
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

컴파일 시 표준 에러 (stderr) 메시지

burrow.cpp: In function 'int main()':
burrow.cpp:35:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d %d %d" , & n , & m , & k);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
burrow.cpp:38:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
          scanf("%d" , & a[i][j]);
          ~~~~~^~~~~~~~~~~~~~~~~~

• Subtask 1: 100 / 100