Cod sursa(job #3160638)

Utilizator Antonio_BiscoveanuAntonio Biscoveanu Antonio_Biscoveanu Data 24 octombrie 2023 19:07:28
Problema Plantatie Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1 kb
#include <fstream>
#define DIM 502

using namespace std;
ifstream cin("plantatie.in");
ofstream cout("plantatie.out");
int n, m, i, i1, j1, i2, j2, r[10][DIM][DIM], lat, L, len;
int E[100010];
int main()
{
    cin>>n>>m;
    for(i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
        cin>>r[0][i][j];
    for(int p=1, lat=2; lat<=n; p++, lat*=2)
    {
        for(i1=1; i1<=n-lat+1; i1++)
        {
            for(j1=1; j1<=n-lat+1; j1++)
            {
                i2=i1+ (lat>>1);
                j2=j1+ (lat>>1);
                r[p][i1][j1]=max(max(r[p-1][i1][j1], r[p-1][i2][j1]), max(r[p-1][i1][j2], r[p-1][i2][j2]));
            }
        }
    }
    E[1] = 0;
    for (int i=2;i<=n;i++)
        E[i] = 1 + E[i/2];
    for(; m; m--)
    {
        cin>>i1>>j1>>L;
        lat=E[L];
        len= (1<<lat);
        i2=i1+L-len;
        j2=j1+L+len;
        cout<<max(max(r[lat][i1][j1], r[lat][i2][j1]), max(r[lat][i1][j2], r[lat][i2][j2]))<<"\n";
    }

    return 0;
}