二维RMQ

求二维ST表

    for (int k=;k<=;k++) for (int l=;l<=;l++)
    for (int i=;i<=n;i++) for (int j=;j<=m;j++){
        int ty=min(j+(<<(l-)),m+),tx=min(n+,i+(<<(k-)));
          if (k==&&l==) continue;else
          if (k==) rmq[i][j][k][l]=max(rmq[i][ty][k][l-],rmq[i][j][k][l-]);else
          if (l==) rmq[i][j][k][l]=max(rmq[tx][j][k-][l],rmq[i][j][k-][l]);else
                    rmq[i][j][k][l]=max(max(rmq[i][j][k-][l-],rmq[tx][j][k-][l-]),
                                        max(rmq[i][ty][k-][l-],rmq[tx][ty][k-][l-]));
      }

求RMQ

  int getrmq(int x1,int y1,int x2,int y2){
      int ranx=log(x2-x1+)/log()+0.001,rany=log(y2-y1+)/log()+0.001;
      int tx=x2+-(<<ranx),ty=y2+-(<<rany);
      return(max(max(rmq[x1][y1][ranx][rany],rmq[tx][y1][ranx][rany]),max(rmq[x1][ty][ranx][rany],rmq[tx][ty][ranx][rany])));
  }