Codeforces Round #401 (Div. 2) C. Alyona and Spreadsheet（暴力）

C. Alyona and Spreadsheet
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
During the lesson small girl Alyona works with one famous spreadsheet computer program and learns how to edit tables.

Now she has a table filled with integers. The table consists of n rows and m columns. By ai, j we will denote the integer located at the i-th row and the j-th column. We say that the table is sorted in non-decreasing order in the column j if ai, j ≤ ai + 1, j for all i from 1 to n - 1.

Teacher gave Alyona k tasks. For each of the tasks two integers l and r are given and Alyona has to answer the following question: if one keeps the rows from l to r inclusive and deletes all others, will the table be sorted in non-decreasing order in at least one column? Formally, does there exist such j that ai, j ≤ ai + 1, j for all i from l to r - 1 inclusive.

Alyona is too small to deal with this task and asks you to help!

Input
The first line of the input contains two positive integers n and m (1 ≤ n·m ≤ 100 000) — the number of rows and the number of columns in the table respectively. Note that your are given a constraint that bound the product of these two integers, i.e. the number of elements in the table.

Each of the following n lines contains m integers. The j-th integers in the i of these lines stands for ai, j (1 ≤ ai, j ≤ 109).

The next line of the input contains an integer k (1 ≤ k ≤ 100 000) — the number of task that teacher gave to Alyona.

The i-th of the next k lines contains two integers li and ri (1 ≤ li ≤ ri ≤ n).

Output
Print “Yes” to the i-th line of the output if the table consisting of rows from li to ri inclusive is sorted in non-decreasing order in at least one column. Otherwise, print “No”.

Example
input
5 4
1 2 3 5
3 1 3 2
4 5 2 3
5 5 3 2
4 4 3 4
6
1 1
2 5
4 5
3 5
1 3
1 5
output
Yes
No
Yes
Yes
Yes
No
Note
In the sample, the whole table is not sorted in any column. However, rows 1–3 are sorted in column 1, while rows 4–5 are sorted in column 3

题意：给定N*M的矩阵，对于第i行第j列的数字A（i,j）往下找A(i+1,j)是否大于等于A(i,j)，如果满足就一直往下一行找，然后记录A(i,j)能够到达的行数。
接着给定K，代表有K次询问，每次询问给出L和R，问第L行到第R行是否有某列满足是严格非递减序列。

思路：纯暴力遍历一次矩阵找出A(i,j)能到达的行数，再遍历一次矩阵找出第i行中所有列能到达的行数的最大值，并记录到另一个一维数组，对于每次询问即可O(1)回答。

代码

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<vector>
using namespace std;
const int maxn=100005;
vector<int>num[maxn];
int result[maxn];
int main()
{
    int N,M;
    scanf("%d%d",&N,&M);
    for(int i=1; i<=N; i++)
    {
        num[i].push_back(0);//num[i][0]填充为0
        for(int j=1; j<=M; j++)
        {
            int flag;
            scanf("%d",&flag);
            num[i].push_back(flag);
        }
    }


    for(int j=1; j<=M; j++)
    {
        for(int i=1; i<N;)
        {
            if(num[i+1][j]>=num[i][j])
            {
                int flag_i=i;
                while(flag_i<N&&num[flag_i+1][j]>=num[flag_i][j])
                    flag_i++;
                for(int k=i; k<flag_i; k++)
                    num[k][j]=flag_i;
                i=flag_i;
            }
            else
            {
                num[i][j]=i;
                i++;
            }
        }
    }

    memset(result,0,sizeof(result));
    result[N]=N;//最后一行特判
    for(int i=1; i<N; i++)
    {
        int max_result=num[i][1];
        for(int j=2; j<=M; j++)
            max_result=max(max_result,num[i][j]);
        result[i]=max_result;
    }

    int K;
    scanf("%d",&K);
    while(K--)
    {
        int L,R;
        scanf("%d%d",&L,&R);
        if(R<=result[L])
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}