Pagini recente » Cod sursa (job #2928017) | Cod sursa (job #2154422) | Cod sursa (job #1603012) | Cod sursa (job #574523) | Cod sursa (job #2909870)
#include <fstream>
using namespace std;
ifstream cin("plantatie.in");
ofstream cout("plantatie.out");
int mat[10][505][505];
int E[505];
int main()
{
int n,m,i1,i2,j1,j2,lat,L,len,k;
cin>>n>>m;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
cin>>mat[0][i][j];
}
}
for(int p=1; lat<=n; p++)
{
for (int i1=1; i1<=n-lat+1; i1++)
{
for (int j1=1; j1<=n-lat+1; j1++)
{
lat=(1<<p);
i2=i1+(lat>>1);
j2=j1+(lat>>1);
mat[p][i1][j1]=max(max(mat[p-1][i1][j1],mat[p-1][i2][j1]),max(mat[p-1][i1][j2],mat[p-1][i2][j2]));
}
}
}
E[1]=0;
for(int i=2; i<=n; i++)
E[i]=1+E[i/2];
for(int i=1; i<=m; i++)
{
cin>>i1>>j1>>L;
k = E[L];
len = (1<<k);
i2 = i1+L-len;
j2 = j1+L-len;
cout<<max(max(mat[k][i1][j1],mat[k][i1][j2]),max(mat[k][i2][j1],mat[k][i2][j2]))<<"\n";
}
return 0;
}