Cod sursa(job #3226485)

Utilizator BidonTurtitBezdedan Eric BidonTurtit Data 21 aprilie 2024 15:55:14
Problema Plantatie Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.1 kb
#include <fstream>
#include <iostream>
#define INF 1000000000
#define dim 502
using namespace std;
ifstream fin ("plantatie.in");
ofstream fout("plntatie.out");
int E[dim];
int n, m, i, j, st, dr, minim, p, e, len,k,lat,i1,j1,i2,j2,L;
int r[10][dim][dim];

inline int maxim(int a, int b)
{
    return(a>b?a:b);
}
int main ()
{
    fin>>n>>m;
    for (i=1; i<=n; i++)
        for (j=1; j<=n; j++)
            fin>>r[0][i][j];
    for (p=1,lat=2; lat <= n; p++,lat*=2)
    {
        for (i1=1; i1<=n; i1++)
        {
            for (j1=1; j1<=n; j1++)
            {
                i2= i1 + lat/2;
                j2 = j1 + lat/2;
                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 (i=2; i<=n; i++)
            E[i] = 1 + E[i/2];





    for (i=1; i<=m; i++)
    {
        fin>>i1>>j1>>L;
        k=E[L];
        int len=1<<k;
        i2=i1+L-len;
        j2=j1+L-len;
        fout<<max(max(r[k][i1][j1],r[k][i2][j1]),max(r[k][i1][j2],r[k][i2][j2]))<<endl;
    }
}