Pagini recente » Cod sursa (job #1953898) | Cod sursa (job #966529) | Cod sursa (job #849888) | Cod sursa (job #392087) | Cod sursa (job #2683873)
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int n,m,i,j,x,y,rmq[20][505][505],k,t,lg,ln,cl,mx;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>rmq[0][i][j];
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++)
rmq[k][i][j]=max(max(rmq[k-1][i][j],rmq[k-1][i][j+(1<<(k-1))]),max(rmq[k-1][i+(1<<(k-1))][j],rmq[k-1][i+(1<<(k-1))][j+(1<<(k-1))]));
for(t=1;t<=m;t++)
{
f>>x>>y>>k;
lg=log2(k);
ln=x+k-1;
cl=y+k-1;
mx=max(max(rmq[lg][x][y],rmq[lg][x][cl-(1<<lg)+1]),max(rmq[lg][ln-(1<<lg)+1][y],rmq[lg][ln-(1<<lg)+1][cl-(1<<lg)+1]));
g<<mx<<'\n';
}
}