

Check CornersTime Limit: 2000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5344 Accepted Submission(s): 1727 Problem Description Paul draw a big m*n matrix A last month, whose entries Ai,j are all integer numbers ( 1 <= i <= m, 1 <= j <= n ). Now he selects some submatrices, hoping to find the maximum number. Then he finds that there may be more than one maximum number, he also wants to know the number of them. But soon he find that it is too complex, so he changes his mind, he just want to know whether there is a maximum at the four corners of the submatrix, he calls this ¡°Check corners¡±. It¡¯s a boring job when selecting too many submatrices, so he asks you for help. (For the ¡°Check corners¡± part: If the submatrix has only one row or column just check the two endpoints. If the submatrix has only one entry just output ¡°yes¡±.) Input There are multiple test cases. For each test case, the first line contains two integers m, n (1 <= m, n <= 300), which is the size of the row and column of the matrix, respectively. The next m lines with n integers each gives the elements of the matrix which fit in nonnegative 32bit integer. The next line contains a single integer Q (1 <= Q <= 1,000,000), the number of queries. The next Q lines give one query on each line, with four integers r1, c1, r2, c2 (1 <= r1 <= r2 <= m, 1 <= c1 <= c2 <= n), which are the indices of the upperleft corner and lowerright corner of the submatrix in question. Output For each test case, print Q lines with two numbers on each line, the required maximum integer and the result of the ¡°Check corners¡± using ¡°yes¡± or ¡°no¡±. Separate the two parts with a single space. Sample Input
Sample Output
Source  
