Pagini recente » Cod sursa (job #2467105) | Cod sursa (job #1890476) | Cod sursa (job #2462656) | Cod sursa (job #1679815) | Cod sursa (job #2851112)
#include <fstream>
using namespace std;
ifstream fin ("plantatie.in");
ofstream fout ("plantatie.out");
int mx(int x,int y,int z,int t){
return max(max(x,y),max(z,t));
}
int n,m,r[11][510][510],log2[505];
int l,c,lat;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
fin>>r[0][i][j];
}
for(int p=1;(1<<p)<=n;p++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
lat=(1<<(p-1));
r[p][i][j]=mx(r[p-1][i-lat][j-lat],r[p-1][i-lat][j],r[p-1][i][j-lat],r[p-1][i][j]);
}
for(int i=2;i<=n;i++)
log2[i]=1+log2[i/2];
for(int i=1;i<=m;i++)
{
fin>>l>>c>>lat;
l+=lat-1;
c+=lat-1;
int p=log2[lat];
int lat2=(1<<p);
fout<<mx(r[p][l-lat+lat2][c-lat+lat2],r[p][l-lat+lat2][c],r[p][l][c-lat+lat2],r[p][l][c])<<"\n";
}
return 0;
}