C - Alyona and Spreadsheet CodeForces - 777C

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 if a_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 all i from l to r - 1 inclusive.

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

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).

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".

问是否存在l到r行的非递减序列

更新每列向上非递减的最小行，更新每列向上非递减的最小行

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

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<math.h>
#define INF 9999999
using namespace std;
typedef long long ll;
int a[100005];
int val[100005],col[100005],row[100005];
int t,k;
int main()
{
int n,m,l,r;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
row[i]=i;
for(int j=1;j<=m;j++)
{
scanf("%d",&t);
if(val[j]>t)
{
col[j]=i;
}
val[j]=t;
row[i]=min(row[i],col[j]); 
}
}
scanf("%d",&k);
while(k--)
{
scanf("%d%d",&l,&r);
if(l>=row[r])
printf("Yes\n");
else printf("No\n");
//printf("(l-1)>=[r-1]?Yes:No\n");
}
return 0;

}