Submission #49189

#	Time	Username	Problem	Language	Result	Execution time	Memory
49189		tmwilliamlin168	Luxury burrow (IZhO13_burrow)	C++14	100 / 100	550 ms	54720 KiB

burrow

#include <bits/stdc++.h>
using namespace std;

const int mxN=1000;
int n, m, k, a[mxN][mxN], lb=1, rb=1e9, mb, a2, a3, b[mxN+1][mxN], l[mxN], r[mxN];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m >> k;
	for(int i=0; i<n; ++i)
		for(int j=0; j<m; ++j)
			cin >> a[i][j];
	while(lb<=rb) {
		mb=(lb+rb)/2, a3=0;
		for(int i=n-1; i>=0; --i)
			for(int j=0; j<m; ++j)
				b[i][j]=a[i][j]<mb?0:b[i+1][j]+1;
		for(int i=0; i<n; ++i) {
			for(int j=0; j<m; ++j) {
				l[j]=j-1;
				while(l[j]>=0&&b[i][l[j]]>=b[i][j])
					l[j]=l[l[j]];
			}
			for(int j=m-1; j>=0; --j) {
				r[j]=j+1;
				while(r[j]<m&&b[i][r[j]]>=b[i][j])
					r[j]=r[r[j]];
				a3=max(b[i][j]*(r[j]-l[j]-1), a3);
			}
		}
		if(a3>=k) {
			lb=mb+1;
			a2=a3;
		} else
			rb=mb-1;
	}
	cout << rb << " " << a2;
}

• Subtask 1: 100 / 100