Pagini recente » Cod sursa (job #924752) | Cod sursa (job #1610335) | Cod sursa (job #1983184) | Cod sursa (job #751354) | Cod sursa (job #1727847)
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int sum[305][305] , mat[305][305];
int n , m , nr , x , sol;
int main() {
f >> n >> m >> nr;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
f >> x;
sum[i][j] = sum[i][j - 1] + x;
mat[i][j] = x + mat[i][j - 1] + mat[i - 1][j] - mat[i - 1][j - 1];
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
int pos = i , st = 0 , aux = 0;
for (int k = 1; k <= j; ++k) {
st = mat[i][j] - mat[i][k - 1] - mat[pos][j] + mat[pos][k - 1];
while (pos > 0 && st + sum[pos][j] - sum[pos][k - 1] <= nr) {
st += sum[pos][j] - sum[pos][k - 1];
--pos;
}
sol = max(sol , (j - k + 1) * (i - pos));
}
}
}
g << sol;
return 0;
}