题目描述:
Check Corners
Time Limit: 2000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3808 Accepted Submission(s): 1351
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 sub-matrices, 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 sub-matrix, he calls this “Check corners”. It’s a boring job when selecting too many sub-matrices, so he asks you for help. (For the “Check corners” part: If the sub-matrix has only one row or column just check the two endpoints. If the sub-matrix 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 non-negative 32-bit 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 upper-left corner and lower-right corner of the sub-matrix 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
4 4
4 4 10 7
2 13 9 11
5 7 8 20
13 20 8 2
4
1 1 4 4
1 1 3 3
1 3 3 4
1 1 1 1
Sample Output
20 no
13 no
20 yes
4 yes
核心题意:
给定一个n * m的矩阵,再给定q个询问,每次询问(r1,c1)为左上角,
(r2,c2)为右下角的子矩形的最大值,并且判断该最大值是否出现在了这个
子矩阵的4个顶角上?
代码实现:
#include<iostream>
#include<cmath>
#include<algorithm>
#define INF 0x3f3f3f3f
#define io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int dp[301][301][9][9];
int a[301][301];
int query(int x,int y,int z,int v)
{
int t1=log(z-x+1)/log(2),t2=log(v-y+1)/log(2);
int ans=max(dp[x][y][t1][t2],dp[z-(1<<t1)+1][v-(1<<t2)+1][t1][t2]);
ans=max(dp[x][v-(1<<t2)+1][t1][t2],ans);
ans=max(ans,dp[z-(1<<t1)+1][y][t1][t2]);
return ans;
}
int main()
{
io;
int n,m,q;
while(cin>>n>>m)
{
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)cin>>a[i][j];
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)dp[i][j][0][0]=a[i][j];
int t1=log(n)/log(2)+1,t2=log(m)/log(2)+1;
for(int l=0;l<t1;++l)
for(int k=0;k<t2;++k)
if(l+k)
for(int i=1;i<=n-(1<<l)+1;++i)
for(int j=1;j<=m-(1<<k)+1;++j)
if(l==0)
dp[i][j][l][k]=max(dp[i][j][l][k-1],dp[i][j+(1<<(k-1))-1+1][l][k-1]);
else
dp[i][j][l][k]=max(dp[i][j][l-1][k],dp[i+(1<<(l-1))-1+1][j][l-1][k]);
cin>>q;
while(q--)
{
int x,y,z,v;
cin>>x>>y>>z>>v;
int ans=query(x,y,z,v);
cout<<ans<<" ";
if(a[x][y]==ans||a[z][v]==ans||a[x][v]==ans||a[z][y]==ans)cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
}
return 0;
}
运行结果:
29177919 | 2019-05-09 22:35:09 | Accepted | 2888 | 7987MS | 30432K | 1556 B | G++ | Pusuing |
The end;