/** made by amunduzbaev **/
#include <bits/stdc++.h>
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
//~ #include <ext/rope>
//~ using namespace __gnu_pbds;
//~ using namespace __gnu_cxx;
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
//~ typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const int N = 1e3+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int s, n, m, k, t, a[N][N];
int tmp[N][N];
int check(int mx){
memset(tmp, 0, sizeof tmp);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(a[i][j] >= mx) tmp[i][j] = 1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(tmp[i][j] && i) tmp[i][j] += tmp[i-1][j];
}
}
int ans = 0;
for(int i=0;i<n;i++){
stack<pii> ss;
vii l(m), r(m);
for(int j=0;j<m;j++){
if(tmp[i][j] == 0){
while(!ss.empty()) ss.pop();
continue;
}
while(!ss.empty() && ss.top().ff > tmp[i][j]) ss.pop();
if(!ss.empty()) l[j] = j - ss.top().ss+1;
else l[j] = 1;
if(!ss.empty() && ss.top().ff == tmp[i][j]) continue;
ss.push({tmp[i][j], j});
}
while(!ss.empty()) ss.pop();
for(int j=m-1;j>=0;j--){
if(tmp[i][j] == 0){
while(!ss.empty()) ss.pop();
continue;
}
while(!ss.empty() && ss.top().ff > tmp[i][j]) ss.pop();
if(!ss.empty()) r[j] = ss.top().ss - j+1;
else r[j] = 1;
if(!ss.empty() && ss.top().ff == tmp[i][j]) continue;
ss.push({tmp[i][j], j});
}
for(int j=0;j<m;j++) umax(ans, (r[j] + l[j] -1)*tmp[i][j]);
}
return ans;
}
void solve(){
cin>>n>>m>>k;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++) cin>>a[i][j];
int l = 1, r = mod;
while(l+1 < r){
int m = (l + r) >>1;
if(check(m) >= k) l = m;
else r = m-1;
}
if(check(r) >= k) l = r;
cout<<l<<" "<<check(l);
return;
}
int main(){
fastios
int t = 1;
if(t) solve();
else {
cin>>t;
while (t--) solve();
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
7 ms |
4332 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
