Pagini recente » Cod sursa (job #608881) | Cod sursa (job #479251) | Cod sursa (job #2255523) | Cod sursa (job #2462727) | Cod sursa (job #2167110)
#include <stdio.h>
#include <math.h>
#include <iostream>
using namespace std;
FILE*f=fopen("plantatie.in","r");
FILE*g=fopen("plantatie.out","w");
int x,y,z,sol,t,k,i,j,n,m,a,d,b,c,j2,rmq[1001][1001][20];
int main()
{
fscanf(f,"%d%d",&n,&m);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fscanf(f,"%d",&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++)
{
a=rmq[i][j+1<<(k-1)][k-1];
b=rmq[i][j][k-1];
c=rmq[i+(1<<(k-1))][j][k-1];
d=rmq[i+(1<<(k-1))][j+(1<<(k-1))][k-1];
rmq[i][j][k]=max(max(a,b),max(c,d));
}
for(t=1;t<=m;t++){
fscanf(f,"%d%d%d",&x,&y,&z);sol=100001;
int l=(int)(log2(z));
a=rmq[x][y][l];
b=rmq[x][y+z-(1<<l)][l];
c=rmq[x+z-(1<<l)][y][l];
d=rmq[x+z-(1<<l)][y+z-(1<<l)][l];
sol=max(max(a,b),max(c,d));
fprintf(g,"%d\n",sol);
}
return 0;
}