CCCPaste

RMQ in 2D pe dreptunghiuri (Euclid 60p)

#include 
#include 
using namespace std;
ifstream cin("euclid.in");
ofstream cout("euclid.out");
int R[10][10][401][401], E[401];
int main()
{
    int t,n,m,h,w;
    cin>>t;
    for(int i = 2;i<=400;i++)
        E[i] = E[i/2] + 1;
    for(int testcase = 1;testcase<=t;testcase++)
    {
        cin>>n>>m>>h>>w;
        for(int i = 1;i<=n;i++)
            for(int j = 1;j<=m;j++)
                cin>>R[0][0][i][j];
        for(int q = 0; (1<