Cod sursa(job #2481047)

Utilizator andaraluca2001Anda Epure andaraluca2001 Data 26 octombrie 2019 13:18:05
Problema Plantatie Scor 50
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 2.02 kb
/*#include <fstream>

using namespace std;
const int MAX=501;
int n,m,log[MAX],r[9][MAX],a[MAX][MAX],lin,col,lat,ind,l,p,q;

ifstream in("plantatie.in");
ofstream out("plantatie.out");

void logaritm(int val)
{
     log[1]=0;
     for(int i=2;i<=val;i++) log[i]=1+log[i/2];
}

int main()
{
    in>>n>>m;

    for(int i=1;i<=n;i++)
       for(int j=1;j<=n;j++) in>>a[i][j];



    for(int k=1;k<=m;k++)
    {
        ind=0;
        in>>lin>>col>>lat;
        for(int i=lin;i<=lin+lat-1;i++)
           {for(int j=col;j<=col+lat-1;j++) r[0][ind]=a[i][j];
             ind++;
           }


           logaritm(ind);

           for(int i=1;i<=log[ind];i++)
     {
        for(int j=0;j+(1<<i)<=ind;j++)
        {
             r[i][j]=max(r[i-1][j],r[i-1][j+(1<<(i-1))]);
        }
     }

            p=0;
            q=ind-1;
           l=log[ind];
          out<<max(r[l][p],r[l][q-(1<<l)+1])<<"\n";


    }

    return 0;
}
*/


#include <fstream>

using namespace std;

ifstream in("plantatie.in");
ofstream out("plantatie.out");

const int MAX=506;
int r[9][500][500],n,m,log[MAX],i1,j1,i2,j2,lat,L;

     void logaritm()
{
     log[1]=0;
     for(int i=2;i<=n;i++) log[i]=1+log[i/2];
}


int main()
{
     in>>n>>m;
     //out<<n<<m<<"\n";

     for(int i=0;i<n;i++)
     {
        for(int j=0;j<n;j++)
        {
          in>>r[0][i][j];
          //out<<r[0][i][j]<<" ";
          }
    }


     logaritm();


     for(int l=1;l<=log[n];l++)
     {
          for(int i=0;i+(1<<l)<=n;i++)
              {
                 for(int j=0;j+(1<<l)<=n;j++)

                 {
                     r[l][i][j]=max(max(r[l-1][i][j],r[l-1][i][j+(1<<(l-1))]), max (r[l-1][i+(1<<(l-1))][j],r[l-1][i+(1<<(l-1))][j+(1<<(l-1))]));

                 }

              }


     }

     for(int i=1;i<=m;i++)
     {
        in>>i1>>j1>>lat;
        i1--;
        j1--;
        i2=i1+lat-1;
        j2=j1+lat-1;
         L=log[lat];

        out<<max(max(r[L][i1][j1],r[L][i1][j2-(1<<L)+1]), max(r[L][i2-(1<<L)+1][j1],r[L][i2-(1<<L)+1][j2-(1<<L)+1]))<<"\n";


     }



    return 0;
}