Pagini recente » Cod sursa (job #2419595) | Cod sursa (job #3122848) | Cod sursa (job #690053) | Cod sursa (job #1364743) | Cod sursa (job #1764643)
#include <iostream>
#include <cstdio>
using namespace std;
int r[501][501][20];
int nrlog2[501];
int maxim(int a, int b, int c, int d){
int maximusss;
if(a>b)
maximusss=a;
else
maximusss=b;
if(c>maximusss)
maximusss=c;
if(d>maximusss)
maximusss=d;
return maximusss;
}
int main()
{
int n,m,i,j,k,l,v3,raspuns;
FILE*fin,*fout;
fin=fopen("plantatie.in","r");
fscanf(fin,"%d%d",&n,&m);
nrlog2[0]=0;
for(i=1;i<=n;i++)
nrlog2[i]=1+nrlog2[i/2];
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
fscanf(fin,"%d",&r[i][j][0]);
for(k=1;(1<<k)<=i && (1<<k)<=j;k++){
r[i][j][k]=maxim(r[i-(1<<(k-1))][j-(1<<(k-1))][k-1],r[i-(1<<(k-1))][j][k-1],r[i][j-(1<<(k-1))][k-1] ,r[i][j][k-1]);
}
}
}
fout=fopen("plantatie.out","w");
for(k=1;k<=m;k++){
fscanf(fin,"%d%d%d",&i,&j,&v3);
l=nrlog2[v3]-1;
raspuns=maxim(r[i+(1<<l)-1][j+(1<<l)-1][l],r[i+(1<<l)-1][j+v3-1][l],r[i+v3-1][j+(1<<l)-1][l],r[i+v3-1][j+v3-1][l]);
fprintf(fout,"%d\n",raspuns);
}
fclose(fin);
fclose(fout);
return 0;
}