Pagini recente » Cod sursa (job #2279343) | Cod sursa (job #2137353) | Cod sursa (job #983679) | Cod sursa (job #1533966) | Cod sursa (job #2929943)
#include <fstream>
using namespace std;
ifstream cin("plantatie.in");
ofstream cout("plantatie.out");
int i, j, n, m, x, st, dr, exp, putere, L, val, p, i1, j1;
int r[17][502][502], e[502];
int main() {
cin>>n>>m;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
cin>>x;
r[0][i][j]=x;
}
}
for(p=1;(1<<p)<=n;p++){
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
putere=(1<<p-1);
r[p][i][j]=max(max(r[p-1][i][j], r[p-1][i+putere][j]), max(r[p-1][i][j+putere], r[p-1][i+putere][j+putere]));
}
}
}
e[1]=0;
for(i=2;i<=n;i++){
e[i]=e[i/2]+1;
}
for(i=1;i<=m;i++){
cin>>i1>>j1>>L;
exp=e[L];
putere=(1<<exp);
cout<<max(max(r[exp][i1][j1], r[exp][i1+L-putere][j1]), max(r[exp][i1][j1+L-putere], r[exp][i1+L-putere][j1+L-putere]))<<"\n";
}
}