Cod sursa(job #137728)

Utilizator perticas_catalinperticas catalin perticas_catalin Data 17 februarie 2008 13:52:21
Problema Plantatie Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.9 kb
#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+p2/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;
}