Poj 3494 (dp)
来源:互联网 发布:glide加载网络图片 编辑:程序博客网 时间:2024/04/20 00:01
Largest Submatrix of All 1’s
Time Limit: 5000MS Memory Limit: 131072KTotal Submissions: 4546 Accepted: 1700Case 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
2 20 00 04 40 0 0 00 1 1 00 1 1 00 0 0 0
Sample Output
04
Source
POJ Founder Monthly Contest – 2008.01.31, xfxyjwf
求一个0-1矩阵中全为1的最大子矩阵。这题关键是看出所求的子矩阵,一定是由某个位置的开始,向上连续1到的最高点的位置为高,向左右两边拓展得到的。这样我就只需先预处理每个点向上到的最高点,然后用一个单调栈,对每行都是O(n)的时间处理出它每个点往左往右的最远点。最后求相乘的最大面积即可。复杂度O(n^2)。
#include<cstdio>#include<iostream>#include<algorithm>#include<vector>#include<cstring>#include<queue>#include<stack>using namespace std;const int maxn = 2000 + 5;const int INF = 2000000000;typedef pair<int, int> P;typedef long long LL;int n,m;int M[maxn][maxn];int u[maxn][maxn];void pre(){ memset(u,0,sizeof(u)); for(int i = 1;i <= n;i++){ for(int j = 1;j <= m;j++){ if(M[i][j] == 0) u[i][j] = 0; else u[i][j] = u[i-1][j]+1; } }}stack<P> S;int l[maxn][maxn],r[maxn][maxn];int main(){ while(scanf("%d%d",&n,&m) != EOF){ for(int i = 1;i <= n;i++){ for(int j = 1;j <= m;j++){ scanf("%d",&M[i][j]); } } pre(); for(int i = 1;i <= n;i++){ while(!S.empty()) S.pop(); for(int j = 1;j <= m;j++){ while(!S.empty() && u[i][j] <= S.top().first) S.pop(); if(S.size() == 0) l[i][j] = 1; else l[i][j] = S.top().second+1; S.push(P(u[i][j],j)); } } for(int i = 1;i <= n;i++){ while(!S.empty()) S.pop(); for(int j = m;j >= 1;j--){ while(!S.empty() && u[i][j] <= S.top().first) S.pop(); if(S.size() == 0) r[i][j] = m; else r[i][j] = S.top().second-1; S.push(P(u[i][j],j)); } } int ans = 0; for(int i = 1;i <= n;i++){ for(int j = 1;j <= m;j++){ ans = max(ans,u[i][j]*(r[i][j]-l[i][j]+1)); } } printf("%d\n",ans); } return 0;}
- Poj 3494 (dp)
- poj 3494 dp+单调栈
- poj dp
- 【dp】POJ
- 【dp】POJ
- [DP] POJ
- [DP] POJ
- [DP] POJ
- 【dp】POJ
- POJ 3670 && POJ 3671 (dp)
- 【DP】 POJ 1080
- poj 1163经典DP
- poj 1088 滑雪(DP)
- poj 1770 树形dp
- POJ 1179 Polygon(DP)
- POJ 1221 dp
- POJ 1953 DP
- POJ 2033 DP
- 常见的数据库面试大全
- Cocos2d-x学习笔记(七)实例——绘制图形
- 解析java iterator 原理
- JS语法详解
- 杭电1023
- Poj 3494 (dp)
- 博客记事
- 正则表达式
- VS 环境下生成静态lib库及调用方法
- hdu Matrix 2119 二分图匹配
- linux内核内存管理学习之二(物理内存管理--伙伴系统)
- 集合ArrayList
- 12-Oracle学习_索引-视图-序列-三范式
- main函数中的参数argv与argv[ ]的探讨