Pagini recente » Cod sursa (job #3240307) | Cod sursa (job #1238070) | Cod sursa (job #3238773) | Cod sursa (job #3272897) | Cod sursa (job #1517510)
#include <fstream>
#define dim 505
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int lg[2*dim],mat[10][2*dim][2*dim],n,m,i,j,k,lin,col,linfin,colfin,diff,ans,half,lat,logi,l,c;
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>mat[0][i][j];
for(i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(k=1;(1 << k)<=n;k++)
for(i=1;i+(1 << k)-1<=n;i++)
for(j=1;j+(1 << k)-1<=n;j++)
{
mat[k][i][j]=max(mat[k][i][j],mat[k-1][i][j]);
mat[k][i][j]=max(mat[k][i][j],mat[k-1][i][j+(1 << k)/2]);
mat[k][i][j]=max(mat[k][i][j],mat[k-1][i+(1 << k)/2][j]);
mat[k][i][j]=max(mat[k][i][j],mat[k-1][i+(1 << k)/2][j+(1 << k) /2]);
}
for(i=1;i<=m;i++)
{
fin>>l>>c>>lat;
logi=lg[lat];
ans=max(max(mat[logi][l][c],mat[logi][l][c+lat-(1 << logi)]),max(mat[logi][l+lat-(1 << logi)][c],mat[logi][l+lat-(1 << logi)][c+lat-(1 << logi)]));
fout<<ans<<'\n';
}
return 0;
}