Pagini recente » Cod sursa (job #1728282) | Cod sursa (job #3197425) | Istoria paginii runda/igorj_3 | Cod sursa (job #286150) | Cod sursa (job #1549081)
#include<fstream>
#include<iostream>
#include<vector>
#include <cstring>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int n,m,k,i,j,p,x,y,t,v[310],sol,sum;
short int a[305][305];
void solve(int p)
{
int i,j,st;
st=1;sum=0;
for(i=1;i<=m;i++)
{
sum=sum+v[i];
while(sum>x and st<=i)
{
sum=sum-v[st];
st++;
}
if(sol<p*(i-st+1) )
{
sol=p*(i-st+1);
}
}
//fout<<sol<<"\n";
/*for(i=1;i<=m;i++)
{
fout<<v[i]<<" ";
}
fout<<"\n";*/
}
int main()
{
fin>>n>>m>>x;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
fin>>a[i][j];
a[i][j]+=a[i-1][j];
}
}
sol=0;
for(i=1;i<=n;i++)
{
for(j=i;j<=n;j++)
{
for(k=1;k<=m;k++)
{
v[k]=a[j][k]-a[i-1][k];
}
//fout<<i<<" "<<j<<"\n";
solve(j-i+1);
}
}
fout<<sol<<"\n";
/*for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
fout<<a[i][j]<<" ";
}
fout<<"\n";
}*/
}