Cod sursa(job #2018274)

Utilizator cipri321Marin Ciprian cipri321 Data 4 septembrie 2017 11:56:25
Problema Plantatie Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.94 kb
#include <fstream>
#define DIM 1<<9
using namespace std;
ifstream fi("plantatie.in");
ofstream fo("plantatie.out");
int n,m;
int RMQ[10][DIM][DIM];
int LG[DIM];
void initRMQ()
{
    for(int i=1;(1<<i)<=n;i++)
        for(int j=1;j<=n-(1<<(i-1))+1;j++)
            for(int k=1;k<=n-(1<<(i-1))+1;k++)
                RMQ[i][j][k]=max(RMQ[i-1][j][k],max(RMQ[i-1][j][k+(1<<(i-1))],max(RMQ[i-1][j+(1<<(i-1))][k],RMQ[i-1][j+(1<<(i-1))][k+(1<<(i-1))])));
}
int main()
{
    fi>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            fi>>RMQ[0][i][j];
    initRMQ();
    for(int i=2;i<=n;i++)
        LG[i]=LG[i/2]+1;
    for(int i=1;i<=m;i++)
    {
        int l,c,k;
        fi>>l>>c>>k;
        int ln=l+k-1,cn=c+k-1;
        k=LG[k];
        fo<<max(RMQ[k][l][c],max(RMQ[k][l][cn-(1<<k)+1],max(RMQ[k][ln-(1<<k)+1][c],RMQ[k][ln-(1<<k)+1][cn-(1<<k)+1])))<<"\n";
    }
    fi.close();
    fo.close();
    return 0;
}