zoukankan      html  css  js  c++  java
  • 第一周任务Largest Submatrix of All 1’s

    Largest Submatrix of All 1’s
    Time Limit: 5000MS   Memory Limit: 131072K
    Total Submissions: 9512   Accepted: 3406
    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

    2 2
    0 0
    0 0
    4 4
    0 0 0 0
    0 1 1 0
    0 1 1 0
    0 0 0 0

    Sample Output

    0
    4

    Source


     
    思路:
    这道题是二维数组,跟上一道题多了一维,那么我们就一行遍历,求一行中最大的矩形,再行遍历的时候就更新最大矩形面积。
     
     

     
    代码:(数组)
    #include<iostream>
    #include<stdio.h>
    #include<string.h>
    using namespace std;
    typedef long long ll;
    const int maxn = 2e3+10;
    int a[maxn][maxn];
    int L[maxn],R[maxn]; 
    int st[maxn];
    int main(){
        int m,n;
        while(scanf("%d%d",&m,&n)!=EOF){
            for(int i=0;i<=n;i++)
                a[0][i] = 0;
            for(int i=1;i<=m;i++){
                for(int j=0;j<n;j++){
                    scanf("%d",&a[i][j]);
                    if(a[i][j]!=0)
                        a[i][j] = a[i][j] +a[i-1][j]; //这里是关键
                }
            }    
                    
            int res = 0;
            for(int i=1;i<=m;i++){
                memset(st,0,sizeof(st));
                int t = 0;
                for(int j=0;j<n;j++){ 
                    while(t>0&&a[i][st[t-1]]>=a[i][j]) t--;
                    L[j] = t==0?0:(st[t-1]+1);
                    st[t++] = j;  
                }
                t=0;
                for(int j = n-1;j>=0;j--){
                    while(t>0&&a[i][st[t-1]]>=a[i][j]) t--;
                    R[j] = t==0?n:(st[t-1]);
                    st[t++] = j;
                }
                for(int j=0;j<n;j++){
                    res=max(res,a[i][j]*(R[j]-L[j]));
                }
            }        
            cout<<res<<endl;
        }
        return 0;
    }
     代码2:栈
    #include<iostream>
    #include<stdio.h>
    #include<string.h>
    #include<stack>
    using namespace std;
    typedef long long ll;
    const int maxn = 2e3+10;
    int a[maxn][maxn];
    stack<int> s;
    int main(){
        int m,n;
        while(cin>>m&&cin>>n){
            for(int i=1;i<=m;i++)
                a[0][i] = 0;
            for(int i=1;i<=m;i++){
                for(int j=1;j<=n;j++){
                    scanf("%d",&a[i][j]);
                    if(a[i][j]!=0)
                        a[i][j] = a[i-1][j]+1;
                }    
            }
            ll res = 0;
            for(int i=1;i<=m;i++){
                while(!s.empty()) s.pop();
                int j = 1;
                while(j<=n+1){
                    if(s.empty()||a[i][s.top()]<=a[i][j])
                        s.push(j++);
                    else{
                        int t=s.top();
                        s.pop();
                        ll wid = s.empty()?(j-1):(j-s.top()-1);
                        res = max(res,wid*a[i][t]);
                    }
                }
            }
            cout<<res<<endl;
        }
        return 0;
    }
     
     
  • 相关阅读:
    气象数据集数据和相关源码
    农产品质量追溯系统/质量安全追溯系统
    Nutch2.x 演示抓取第一个网站
    Nutch的配置以及动态网站的抓取
    leach-matlab
    leach协议matlab仿真代码
    无线传感器网络数据融合技术
    无线传感器网络数据融合概述
    No pressure, no diamonds.
    Hibernate缓存应用的积累与总结
  • 原文地址:https://www.cnblogs.com/lusiqi/p/11603611.html
Copyright © 2011-2022 走看看