Pagini recente » Cod sursa (job #1822113) | Cod sursa (job #1522930) | Cod sursa (job #2270770) | Cod sursa (job #2794002) | Cod sursa (job #2167557)
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int n,m,i,j,k,l,rmq[501][501][10],x,y,lg;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>rmq[i][j][0];
for(k=1;(1<<k)<=n;k++)
for(i=1;i<=n-(1<<(k-1));i++)
for(j=1;j<=n-(1<<(k-1));j++)
rmq[i][j][k]=max(max(rmq[i][j][k-1],rmq[i][j+(1<<(k-1))][k-1]),max(rmq[i+(1<<(k-1))][j][k-1],rmq[i+(1<<(k-1))][j+(1<<(k-1))][k-1]));
for(i=1;i<=m;i++)
{
f>>x>>y>>lg;
l=log2(lg);
g<<max(max(rmq[x][y][l],rmq[x][y+lg-(1<<l)][l]),max(rmq[x+lg-(1<<l)][y][l],rmq[x+lg-(1<<l)][y+lg-(1<<l)][l]))<<'\n';
}
return 0;
}