Pagini recente » Cod sursa (job #2806822) | Cod sursa (job #2853281) | Cod sursa (job #277967) | Cod sursa (job #2365160) | Cod sursa (job #2808375)
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int n, m, x, a, v[310][310], ans;
int main() {
fin >> n >> m >> x;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
fin >> v[i][j];
v[i][j] += v[i - 1][j];
}
}
for(int i = 1; i <= n; i++) {
for(int j = i; j <= n; j++) {
int st = 1, dr = 1, sc = 0;
for(; dr <= m; dr++) {
sc += v[j][dr] - v[i - 1][dr];
while(st <= dr && sc > x) {
sc -= (v[j][st] - v[i - 1][st]);
st++;
}
if(st <= dr) {
ans = max(ans, (j - i + 1) * (dr - st + 1));
}
}
}
}
fout << ans;
return 0;
}