POJ 3494 Largest Submatrix of All 1’s

最新推荐文章于 2019-10-02 15:29:21 发布

~ 知至~

最新推荐文章于 2019-10-02 15:29:21 发布

阅读量278

点赞数

文章标签：单调栈思维

本文链接：https://blog.csdn.net/S_999999/article/details/89066667

版权

随便写写专栏收录该内容

63 篇文章 6 订阅

订阅专栏

Largest Submatrix of All 1’s

Time Limit: 5000MS		Memory Limit: 131072K
Total Submissions: 8390		Accepted: 3039
Case Time Limit: 2000MS

Description

Given a m-by-n (0,1)-matrix, of all its submatrices of all 1’s which is the largest? By largest we mean that the submatrix has the most elements.

Input

The input contains multiple test cases. Each test case begins with m and n (1 ≤ m, n ≤ 2000) on line. Then come the elements of a (0,1)-matrix in row-major order on m lines each with n numbers. The input ends once EOF is met.

Output

For each test case, output one line containing the number of elements of the largest submatrix of all 1’s. If the given matrix is of all 0’s, output 0.

Sample Input

Sample Output

0
4

我们要找到的某个矩形可以转换成以某一个行开始的 histogram的最大矩形问题。

矩形的高，要自己找。

	      /* 1. 一行一行的枚举 
		     2. 构建矩形 
		     3. 单调栈模型求最大的矩形面积。 
             G++可以过  		  
*/ 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cstring>
#include<cmath>
#include<stack>
using namespace std;
int   mat[2009][2009];  
int   h[2009][2009];
int   w[2009];
int   n,m;
void  init( ){
	  memset( h,0,sizeof(h));
	  for( int i=1;i<=m;i++){
	  	   for( int j=1;j<=n;j++){
	  	   	    if( mat[i][j] ==0  ){
	  	   	        h[i][j] = 0; 	
			    }
			    else h[i][j] = h[i-1][j]+1;
			 }
	  }  
	  for( int i=1;i<=m;i++)
	       h[i][n+1] = 0;
}
int   solve( int row ){
	  // 单调栈求最大矩形面积。 
	  int ans = 0;
	  memset(w,0,sizeof(w));
	  stack<int> s;
      int pos = 0;
	  for( int i=1;i<=n+1;i++){
           if( s.empty() || h[row][i] >= s.top()   ){
           	   s.push( h[row][i] );
           	   w[++pos] = 1;
		   }
		   else {
		   	   int width = 0;
			   while( !s.empty()  && s.top() >= h[row][i] ){
			   	      width+=w[pos];
			   	      ans = max( ans , s.top() * width );
			   	      s.pop();
			   	      pos--;
			   }
			   s.push( h[row][i]);
			   w[++pos] = width + 1;   
		   }  
	  } 	  
	  return ans ;  
}
int   main(void){
	 
      while( scanf("%d%d",&m,&n)!=EOF ){
		   for( int i=1;i<=m;i++){
		   	    for( int j=1;j<=n;j++){
		   	    	  scanf("%d",&mat[i][j]);
				   }
		   }
		   
		   init();//构建矩形。 
		   int ans = 0;
		   for( int i= m;i>=1;i-- ){ // 一行一行枚举 
		   	    ans = max( ans , solve(i) ); // 单调栈求最大矩形面积。 
		   } 
		   printf("%d\n",ans);
	}
	
	
	return 0;
}