Pagini recente » Cod sursa (job #1130181) | Cod sursa (job #974482) | Cod sursa (job #561) | Cod sursa (job #1446068) | Cod sursa (job #196403)
Cod sursa(job #196403)
#include <stdio.h>
#include <string.h>
#define NMAX 310
int N, M, K;
int a[NMAX][NMAX];
int nr[NMAX];
inline int MAX(int a, int b) { return (a > b) ? a : b; }
int main()
{
int i, j, k, k1, rez = 0, s;
freopen("teren.in", "r", stdin);
freopen("teren.out", "w", stdout);
scanf("%d %d %d", &N, &M, &K);
for (i = 1; i <= N; i++)
for (j = 1; j <= M; j++)
scanf("%d", &a[i][j]);
for (i = 1; i <= N; i++) {
memset(nr, 0, sizeof(nr));
for (j = i; j <= N; j++) {
for (k = 1; k <= M; k++) nr[k] += a[j][k];
for (k = 1, k1 = 1, s = 0; k <= N; k++) {
s += nr[k];
while (s > K) s -= nr[k1++];
rez = MAX(rez, (j - i + 1) * (k - k1 + 1));
}
}
}
printf("%d\n", rez);
return 0;
}