Cod sursa(job #3177073)
Utilizator | Data | 28 noiembrie 2023 14:24:30 | |
---|---|---|---|
Problema | Teren | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.92 kb |
#include <fstream>
using namespace std;
ifstream in("teren.in");
ofstream out("teren.out");
int n, m, x;
int v[305][305];
int s[305];
int main()
{
in>>n>>m>>x;
for(int i = 1; i<=n; i++)
{
for(int j = 1; j<=m; j++)
{
in>>v[i][j];
}
}
int ans = 0;
for(int i = 1; i<=n; i++)
{
for(int j = 1; j<=m; j++)
{
s[j] = 0;
}
for(int i2 = i; i2<=n; i2++)
{
int st = 1;
int total = 0;
for(int j = 1; j<=m; j++)
{
s[j] += v[i2][j];
total += s[j];
while(total > x)
{
total -= s[st];
st++;
}
ans = max(ans, (j - st + 1) * (i2 - i + 1));
}
}
}
out<<ans;
return 0;
}