# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97449 | Kastanda | Luxury burrow (IZhO13_burrow) | C++11 | 493 ms | 14172 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// I do it for the glory
#include<bits/stdc++.h>
using namespace std;
const int N = 1009;
int n, m, k, L[N], R[N], A[N][N], up[N];
inline int Solve(int X)
{
int MX = 0;
memset(up, 0, sizeof(up));
for (int i = 1; i <= n; i++)
{
up[0] = up[m + 1] = -1;
for (int j = 1; j <= m; j++)
up[j] = (A[i][j] < X) ? (0) : (up[j] + 1);
for (int j = 1; j <= m; j++)
{
L[j] = j - 1;
while (up[L[j]] >= up[j])
L[j] = L[L[j]];
}
for (int j = m; j; j--)
{
R[j] = j + 1;
while (up[R[j]] >= up[j])
R[j] = R[R[j]];
MX = max(MX, (R[j] - L[j] - 1) * up[j]);
}
}
return MX;
}
int main()
{
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
scanf("%d", &A[i][j]);
int le = 0, ri = 1e9 + 7, md;
while (ri - le > 1)
{
md = (le + ri) >> 1;
if (Solve(md) >= k)
le = md;
else
ri = md;
}
return !printf("%d %d\n", le, Solve(le));
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |