Cod sursa(job #1210078)

Utilizator Adrian1997Radulescu Adrian Adrian1997 Data 19 iulie 2014 09:43:39
Problema Plantatie Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.12 kb
#include <fstream>
#include <cmath>
#define DIM 511
using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int n,m,a[11][DIM][DIM],p[DIM];

int main(void){
    register int i,j,iv,jv,L,k,x,y,q;

    f>>n>>m;
    for(i=1;i<=n;i++){
        for(j=1;j<=n;j++) f>>a[0][i][j];
        if(i!=1)
            p[i]=1+p[i/2];
    }

    for(k=1;(1<<k)<=n;k++){
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++){
                a[k][i][j]=a[k-1][i][j];
                iv=(i+(1<<(k-1)));
                jv=(j+(1<<(k-1)));
                if(iv<=n && a[k-1][iv][j]>=a[k][i][j])
                    a[k][i][j]=a[k-1][iv][j];
                if(jv<=n && a[k-1][i][jv]>=a[k][i][j])
                    a[k][i][j]=a[k-1][i][jv];
                if(iv<=n && jv<=n && a[k-1][iv][jv]>=a[k][i][j])
                    a[k][i][j]=a[k-1][iv][jv];
            }
    }

    for(i=1;i<=m;i++){
        f>>x>>y>>k;
        q=p[k];
        L=1<<p[k];
        g<<max(max(a[q][x][y],a[q][x+k-L][y]),max(a[q][x][y+k-L],a[q][x+k-L][y+k-L]))<<"\n";
    }
    f.close();
    g.close();
    return 0;
}