#include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
using namespace std;
using ll = long long;
const int N = 1000+5 , inf = 2e9 + 7;
const ll INF = 1e18 , mod = 1e9+7 , P = 6547;
int a[N][N];
int dp[N][N];
int p[N];
int L[N] , R[N];
void solve(int tc) {
int n , m, k;
cin >> n >> m >> k;
for(int i = 1; i <= n; i ++) {
for(int j = 1; j <= m; j ++) {
cin >> a[i][j];
}
}
int l = 1, r = 1e9;
int ans, mxs;
while(l <= r) {
int md = l+r >> 1;
fill(p+1 , p+m+1 , 0);
int mx = 0;
for(int i = 1; i <= n; i ++) {
for(int j = 1; j <= m; j ++) {
int c = (a[i][j] >= md);
if(c == 0) {
p[j] = 0;
}
else {
p[j] ++;
}
}
stack<int> st;
st.push(0); p[0] = -1;
for(int j = 1; j <= m; j ++) {
while(st.size() && p[st.top()] >= p[j]) {
st.pop();
}
L[j] = st.top();
st.push(j);
}
while(st.size()) st.pop();
st.push(m+1); p[m+1] = -1;
for(int j = m; j >= 1; j --) {
while(st.size() && p[st.top()] >= p[j]) {
st.pop();
}
R[j] = st.top();
st.push(j);
}
for(int j = 1; j <= m; j ++) {
mx = max(mx, (R[j]-L[j]-1)*p[j]);
}
}
if(mx >= k) {
ans = md;
mxs = mx;
l = md+1;
}
else {
r = md-1;
}
}
cout << ans << ' ' << mxs;
}
/*
*/
main() {
ios;
int tt = 1 , tc = 0;
// cin >> tt;
while(tt --) {
solve(++tc);
}
return 0;
}
Compilation message
burrow.cpp: In function 'void solve(int)':
burrow.cpp:32:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
32 | int md = l+r >> 1;
| ~^~
burrow.cpp: At global scope:
burrow.cpp:82:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
82 | main() {
| ^~~~
burrow.cpp: In function 'void solve(int)':
burrow.cpp:78:24: warning: 'mxs' may be used uninitialized in this function [-Wmaybe-uninitialized]
78 | cout << ans << ' ' << mxs;
| ^~~
burrow.cpp:78:17: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
78 | cout << ans << ' ' << mxs;
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
468 KB |
Output is correct |
| 7 |
Correct |
1 ms |
340 KB |
Output is correct |
| 8 |
Correct |
6 ms |
724 KB |
Output is correct |
| 9 |
Correct |
10 ms |
1108 KB |
Output is correct |
| 10 |
Correct |
28 ms |
1108 KB |
Output is correct |
| 11 |
Correct |
56 ms |
1236 KB |
Output is correct |
| 12 |
Correct |
26 ms |
2260 KB |
Output is correct |
| 13 |
Correct |
34 ms |
724 KB |
Output is correct |
| 14 |
Correct |
86 ms |
1876 KB |
Output is correct |
| 15 |
Correct |
86 ms |
1892 KB |
Output is correct |
| 16 |
Correct |
92 ms |
1876 KB |
Output is correct |
| 17 |
Correct |
105 ms |
2296 KB |
Output is correct |
| 18 |
Correct |
255 ms |
2680 KB |
Output is correct |
| 19 |
Correct |
261 ms |
3080 KB |
Output is correct |
| 20 |
Correct |
513 ms |
3472 KB |
Output is correct |
| 21 |
Correct |
473 ms |
3916 KB |
Output is correct |
| 22 |
Correct |
582 ms |
4264 KB |
Output is correct |
| 23 |
Correct |
583 ms |
4256 KB |
Output is correct |
| 24 |
Correct |
409 ms |
4072 KB |
Output is correct |
| 25 |
Correct |
441 ms |
4372 KB |
Output is correct |
