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!
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).
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".
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
Yes
No
Yes
Yes
Yes
No
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的矩阵,问你从第l行到第r行是否满足有一列非递减序列;
思路:从上到下求出每一列的数可以向上到达的行数,用数组记录每一行可到达的最上面的一层,然后比较第r行能向上到达的最大行数与l比较,若小于等于l就说明存在有一列这样的非递减序列;
下面附上我的代码:
#include<bits/stdc++.h>
using namespace std;
const int M=100005;
int a[M],b[M],c[M];//a数组记录每一行的值,b记录一行中每一列的向上到达的层数,c负责记录这一行中
int n,m,l,r,k,x;//所能到达的最上面的层数
void solve()
{
while(cin>>n>>m){
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c));
for(int i=0;i<n;i++)
{
c[i]=i;//初始化,默认每一行的最向上的层数为自己
for(int j=0;j<m;j++)
{
scanf("%d",&x);
if(x<a[j])//如果小于上面的数说明到这就不是递增的了
b[j]=i;//那么这一列的能向上到达的层数为i;
a[j]=x;
if(b[j]<c[i]) c[i]=b[j];//c记录这一行的最小值
}
}
scanf("%d",&k);
while(k--){
cin>>l>>r;
if(c[r-1]<=l-1) puts("Yes");
else puts("No");
}
}
}
int main()
{
solve();
return 0;
}