Pagini recente » Cod sursa (job #1218446) | Cod sursa (job #1649425) | Cod sursa (job #752774) | Cod sursa (job #1657961) | Cod sursa (job #478875)
Cod sursa(job #478875)
#include <fstream>
using namespace std;
int v[1<<9][1<<9],a[1<<9],m,n;
ifstream in("teren.in");
ofstream out("teren.out");
int main()
{
int i,j,k,X,L,arie=0,st;
in>>n>>m>>X;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
{
in>>v[i][j];
v[i][j]+=v[i-1][j];
}
for (i=1;i<=n;i++)
for (j=i;j<=n;j++)
{
for (k=1;k<=m;k++)
a[k]=v[j][k]-v[i-1][k]+a[k-1];
st=L=0;
for (k=1;k<=m;k++)
{
while (st<=k && a[st]+X<a[k])
st++;
if (L<k-st)
L=k-st;
}
if (arie<L*(j-i+1))
arie=L*(j-i+1);
}
out<<arie<<"\n";
return 0;
}