Pagini recente » Cod sursa (job #2364052) | Cod sursa (job #488182) | Cod sursa (job #1028382) | Cod sursa (job #1632207) | Cod sursa (job #137168)
Cod sursa(job #137168)
#include<stdio.h>
FILE*fin=fopen("plantatie.in","r");
FILE*fout=fopen("plantatie.out","w");
#define maxn 501
#define max(a,b)((a)>(b)?(a):(b))
int n,m,a[maxn][maxn],b[maxn][maxn][12];
int main()
{
int i,j,k,p,p2,rez,o;
fscanf(fin,"%d%d",&n,&m);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
fscanf(fin,"%d",&a[i][j]);
b[i][j][0]=a[i][j];
}
p2=2;p=1;
while(p2<=n)
{
for(i=1;i<=n-p2+1;i++)
for(j=1;j<=n-p2+1;j++)
b[i][j][p]=max(max(b[i][j][p-1],b[i+p/2][j][p-1]),max(b[i][j+p2/2][p-1],b[i+p2/2][j+p2/2][p-1]));
p2=p2<<1;
p++;
}
for(o=1;o<=m;o++)
{
fscanf(fin,"%d%d%d",&i,&j,&k);
p2=1<<9;
p=9;
while(!(p2&k))
{
p2=p2>>1;
p--;
}
rez=max(max(b[i][j][p],b[i+k-p2][j][p]),max(b[i][j+k-p2][p],b[i+k-p2][j+k-p2][p]));
fprintf(fout,"%d\n",rez);
}
fclose(fin);
fclose(fout);
return 0;
}