Pagini recente » Cod sursa (job #349867) | Cod sursa (job #362171) | Cod sursa (job #2913226) | Cod sursa (job #766621) | Cod sursa (job #2808964)
#include <fstream>
#define mF "teren"
std::ofstream out(mF ".out");
std::ifstream in(mF ".in");
constexpr int N = 301; int V[N][N];
int main()
{
int n, m, k, s = 0; in >> n >> m >> k; for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) in >> V[i][j],
V[i][j] += V[i-1][j] + V[i][j-1] - V[i-1][j-1];
for (int a = 0; a < n; a++) for (int b = 0; b < m; b++)
for (int c = a+1; c <= n; c++) for (int d = b+1; d <= m; d++)
if (s < (c - a) * (d - b) and V[c][d] + V[a][b]
- V[a][d] - V[c][b] <= k) s = (c - a) * (d - b);
out << s;}