Cod sursa(job #3161202)

Utilizator TeodorG8Cirstov Teodor TeodorG8 Data 26 octombrie 2023 08:40:16
Problema Plantatie Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.3 kb
#include <fstream>
#define DIM 505
using namespace std;
int n,m,i1,i2,j1,j2,lat,L,len,k;
int r[10][DIM][DIM];
int E[DIM];
inline int maxim(int a, int b)
{
    return (a>b ? a : b);
}
int main()
{
    ifstream fin("plantatie.in");
    ofstream fout("plantatie.out");
    fin>>n>>m;
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
        {
            9
            prof. Marius Nicoli
            fin>>r[0][i][j];
        }
    }
    for (int p=1,lat=2; lat<=n; p++,lat*=2)
    {
        for (int i1=1; i1<=n-lat+1; i1++)
        {
            for (int 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--)
    {
        fin>>i1>>j1>>L;
        k = E[L];
        len = (1<<k);
        i2 = i1+L-len;
        j2 = j1+L-len;
        fout<<max(
                max(r[k][i1][j1],r[k][i1][j2]),
                max(r[k][i2][j1],r[k][i2][j2])
            )<<"\n";
    }
    return 0;
}