Pagini recente » Cod sursa (job #1198968) | Cod sursa (job #277744) | Monitorul de evaluare | Istoria paginii utilizator/gica-gicuta | Cod sursa (job #1042021)
#include <fstream>
//----------------------------
#define in "teren.in"
#define out "teren.out"
#define Max_Size 309
//----------------------------
std :: ifstream f(in);
std :: ofstream g(out);
int N, M, X, Sol;
int A[Max_Size][Max_Size], S[Max_Size][Max_Size];
//-----------------------------
inline void Read_Data()
{
f >> N >> M >> X;
for(int i = 1; i <= N; ++i)
for(int j = 1; j <= M; ++j)
f >> A[i][j];
}
//-----------------------
inline void Count()
{
for(int i = 1; i <= N; ++i)
for(int j = 1; j <= M; ++j)
S[i][j] = A[i][j] + S[i - 1][j];
}
//-----------------------
inline void Solve()
{
for(int i = 1; i <= N; ++i)
for(int k = i; k <= N; ++k)
{
int begin = 1, Sum = 0;
for(int j = 1; j <= M; ++j)
{
Sum = Sum + (S[k][j] - S[i - 1][j]);
while(Sum > X)
{
Sum = Sum - (S[k][begin] + S[i - 1][begin]);
++begin;
}
Sol = std :: max( (int)Sol, (j - begin + 1) * (k - i + 1) );
}
}
}
//-----------------------
int main()
{
Read_Data();
Count();
Solve();
g << Sol << '\n';
g.close();
return 0;
}
//-----------------------