| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1297944 | khoavn2008 | Quality Of Living (IOI10_quality) | C++17 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define FOR(i,l,r) for(ll i=(l),_r=(r);i<=_r;i++)
#define FORNG(i,r,l) for(ll i=(r),_l=(l);i>=_l;i--)
#define MASK(i) (1LL<<(i))
#define BIT(x,i) (((x)>>(i))&1LL)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((ll)(v).size())
const ll MOD = 1e9+7, N = 3001;
ll n,m,w,h,a[N][N],ans;
ll b[N][N];
bool check(ll x){
FOR(i,1,n)FOR(j,1,m){
b[i][j] = b[i][j-1] + b[i-1][j] - b[i-1][j-1] + (a[i][j]>=x?+1:-1);
if(i>=w && j >= h){
ll s = b[i][j] - b[i][j-h] - b[i-w][j] + b[i-w][j-h];
if(s>=0)return 1;
}
}
return 0;
}
int main(){
//freopen(".INP", "r", stdin);
//freopen(".OUT", "w", stdout);
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>m>>w>>h;
FOR(i,1,n)FOR(j,1,m)cin>>a[i][j];
ll l = 1, r = n*m;
while(l <= r){
ll mid = (l + r) >> 1;
if(check(mid)){
l = mid + 1;
ans = mid;
}else r = mid - 1;
}
cout<<ans;
}