uva 836 Largest Submatrix

最新推荐文章于 2021-06-29 15:19:04 发布

红鲤鱼遇绿鲤鱼

最新推荐文章于 2021-06-29 15:19:04 发布

阅读量386

点赞数

分类专栏：动态规划文章标签： uva 动态规划

本文链接：https://blog.csdn.net/tengfei461807914/article/details/76397067

版权

动态规划专栏收录该内容

119 篇文章 2 订阅

订阅专栏

原题：
Let A be an N × N matrix of zeros and ones. A submatrix S of A is any group of contiguous entries that forms a square or a rectangle. Write a program that determines the number of elements of the largest submatrix of ones in A. Largest here is measured by area.
Input
The input begins with a single positive integer on a line by itself indicating the number
of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.
The matrix is given line by line. Each line consists of 0’s and 1’s. The order of the matrix is also the number of lines input and 1 < N ≤ 25.
Output
For each test case, the output must follow the description below. The outputs of two
consecutive cases will be separated by a blank line.
The output is the number of elements of the largest submatrix found.
Sample Input
1
10111000
00010100
00111000
00111010
00111111
01011110
01011110
00011110

Sample Output
16

中文：
找出最大1矩阵的和、

#include<bits/stdc++.h>
using namespace std;
int dp[30][30];
int sum[30][30];
char tmps[30][30];
int main()
{
    ios::sync_with_stdio(false);
    int t;
    cin>>t;
    cin.ignore();
    for(int k=1;k<=t;k++)
    {
        memset(dp,0,sizeof(dp));

        cin>>tmps[0];
        int row=strlen(tmps[0]);
        int col=row;

        for(int i=1;i<row;i++)
            cin>>tmps[i];

        for(int i=1;i<=row;i++)
        {
            for(int j=1;j<=col;j++)
                sum[i][j]=tmps[i-1][j-1]-'0';
        }

        for(int i=1;i<row;i++)
        {
            for(int j=1;j<=col;j++)
            {
                if(sum[i+1][j]==1)
                {
                    sum[i+1][j]=sum[i][j]+1;
                }
            }
        }
        int ans=0;
        for(int i=1;i<=row;i++)
        {
            for(int j=1;j<=col;j++)
            {
                int width=1;
                for(int left=j-1;;left--)
                {
                    if(j==0)
                        break;
                    if(sum[i][left]<sum[i][j])
                        break;
                    else
                        width++;
                }
                for(int right=j+1;;right++)
                {
                    if(right==col+1)
                        break;
                    if(sum[i][right]<sum[i][j])
                        break;
                    else
                        width++;
                }
                dp[i][j]=sum[i][j]*width;
                ans=max(dp[i][j],ans);
            }
        }
        cout<<ans<<endl;
        if(k<t)
            cout<<endl;
    }
    return 0;
}