Pagini recente » Cod sursa (job #1031355) | Cod sursa (job #2640503) | Cod sursa (job #1875485) | Cod sursa (job #7399) | Cod sursa (job #2836303)
#include <fstream>
using namespace std;
ifstream cin("plantatie.in");
ofstream cout("plantatie.out");
int r[10][505][505], exp[505], n, m, i, j, p, lat, i1, i2, j1, j2, len, k, l;
int main(){
cin>>n>>m;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
cin>>r[0][i][j];
}
}
for(p=1,lat=2;lat<=n;p++,lat*=2){
for(int i1=1; i1<=n-lat+1; i1++){
for(int j1=1; j1<=n-lat+1; j1++){
i2=i1+(lat>>1);
j2=j1+(lat>>1);
r[p][i1][j1]=max(r[p-1][i1][j1], max(r[p-1][i2][j1], max(r[p-1][i1][j2], r[p-1][i2][j2])));
}
}
}
exp[1]=0;
for(i=2;i<=n;i++){
exp[i]=exp[i/2]+1;
}
for(i=1;i<=m;i++){
cin>>i1>>j1>>l;
k=exp[l];
len=(1<<k);
i2=i1+l-len;
j2=j1+l-len;
cout<<max(max(r[k][i1][j1], r[k][i1][j2]), max(r[k][i2][j1], r[k][i2][j2]));
cout<<"\n";
}
}