Pagini recente » Cod sursa (job #2800723) | Cod sursa (job #1766254)
#include <iostream>
#include <cstdio>
using namespace std;int r[505][505][25];int log[501];int main()
{freopen("plantatie.in","r",stdin);freopen("plantatie.out","w",stdout);int n,m,i,b,a,j;scanf("%d %d",&n,&m);log[1]=0;for(i=2;i<=n;i++)log[i]=1+log[i/2];for(i=1;i<=n;i++){for(j=1;j<=n;j++){scanf("%d",&r[i][j][0]);for(int k=1;(1<<k)<=i && (1<<k)<=j;k++){r[i][j][k]=max(max(r[i-(1<<(k-1))][j-(1<<(k-1))][k-1],r[i-(1<<(k-1))][j][k-1]),max(r[i][j-(1<<(k-1))][k-1] ,r[i][j][k-1]));}}}for(i=1;i<=m;i++){int c;scanf("%d %d %d",&a,&b,&c);int q,l;l=log[c]-1;;q=max(max(r[a+(1<<l)-1][b+(1<<l)-1][l],r[a+(1<<l)-1][b+c-1][l]),max(r[a+c-1][b+(1<<l)-1][l],r[a+c-1][b+c-1][l]));printf("%d\n",q);}return 0;}