codeforce 777C Alyona and Spreadsheet

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 mcolumns. By a_i, 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 ifa_i, j ≤ a_{i + 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 rinclusive 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 a_i, j ≤ a_{i + 1, j} for alli 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 a_i, j (1 ≤ a_i, j ≤ 10⁹).

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 l_i and r_i (1 ≤ l_i ≤ r_i ≤ n).

Output

Print "Yes" to the i-th line of the output if the table consisting of rows from l_ito r_i 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

思维题

给你一个n*M的数组

q次询问

给我r -l

询问你再第r行到第l行是否存在一列满足非递序列

#include<stdio.h>
#include<string.h>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
vector<int>a[100003];
vector<int>b[100003];
int max(int x,int y)
{
    return x>y?x:y;
}
int main()
{
    int n,m,x;

    int h[100090];

    while(~scanf("%d%d",&n,&m))
    {
        for(int i=0; i<n; i++)
        {
            for(int j=0; j<m; j++)
            {
                cin>>x;
                a[i].push_back(x);
                b[i].push_back(1);
            }
        }
        for(int i=1; i<n; i++)
        {
            for(int j=0; j<m; j++)
            {
                if(a[i-1][j]<=a[i][j])
                {
                    b[i][j]=b[i-1][j]+1;
                }
            }
        }
        memset(h,0,sizeof(h));
        for(int i=0; i<n; i++)
        {
            for(int j=0; j<m; j++)
            {
                h[i]=max(b[i][j],h[i]);
            }
        }
        int q;
        cin>>q;
        while(q--)
        {
            int r,l;
            cin>>l>>r;
            if(h[r-1]>=r-l+1)
                printf("Yes\n");
            else printf("No\n");
        }
    }
}

用vector可以。。

也可以先输入n，m再定义数组啊。。

先将数据输入a数组存储起来

b【】数组存贮这个位置的最长非递减子序列

h数组存储的是这一行当中的最大值

h[i]>=r-l+1

输出yes

else cout《《no