Pagini recente » Cod sursa (job #2789489) | Cod sursa (job #1966097) | Cod sursa (job #2391218) | Cod sursa (job #1428392) | Cod sursa (job #497153)
Cod sursa(job #497153)
#include <fstream>
using namespace std;
ifstream in("teren.in");
ofstream out("teren.out");
int n,m,x,ariecurent,ariemax=0;
int a[301][301];
int aux[301][301];
void prelucrare(){
int i,j,k,up,down,count;
for(i=1;i<=m;i++){
for(j=i;j<=m;j++){
ariecurent=0;
up=1;
down=0;
count=0;
while(up<=n){
while(down<=n && count<=x){
down++;
ariecurent=ariecurent+j-i+1;
count+=aux[down][j]-aux[down][i-1];
}
ariecurent=ariecurent-j+i-1;
if(ariecurent>ariemax)
ariemax=ariecurent;
up++;
count-=aux[down][j]-aux[down][i-1];
}
}
}
out<<ariemax;
}
int main(){
int i,j;
in>>n>>m>>x;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
in>>a[i][j];
aux[i][j]=aux[i][j-1]+a[i][j];
}
}
prelucrare();
return 0;
}