Pagini recente » Cod sursa (job #1703917) | Cod sursa (job #2183776) | Cod sursa (job #1806885) | Cod sursa (job #1337449) | Cod sursa (job #2071855)
#include <fstream>
using namespace std;
int n,m,x,i,j,a[302][302],b[302][302],c[302][302],maxi;
ifstream f("teren.in");
ofstream g("teren.out");
int main()
{ f>>n>>m>>x;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
b[1][1]=1;
if(c[1][1]==1)
c[1][1]=1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++){
b[i][j]=b[i-1][j]+b[i][j-1]-b[i-1][j-1]+1;
c[i][j]=c[i-1][j]+c[i][j-1]-c[i-1][j-1];
if(a[i][j]==1)
c[i][j]++;
}
maxi=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(maxi<b[i][j]&&x>=c[i][j])
maxi=b[i][j];
g<<maxi;
return 0;
}