HDU OJ Matrix Swapping II

2024-06-15 10:13:39

Matrix Swapping II

Time Limit : 9000/3000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 12 Accepted Submission(s) : 8

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

Problem Description

Given an N * M matrix with each entry equal to 0 or 1. We can find some rectangles in the matrix whose entries are all 1, and we define the maximum area of such rectangle as this matrix’s goodness.
We can swap any two columns any times, and we are to make the goodness of the matrix as large as possible.

Input

There are several test cases in the input. The first line of each test case contains two integers N and M (1 ≤ N,M ≤ 1000). Then N lines follow, each contains M numbers (0 or 1), indicating the N * M matrix

Output

Output one line for each test case, indicating the maximum possible goodness.

Sample Input

Sample Output

4
2

分析：对每一行进行处理然后再叠加，到每一行用sum[j]记下到这一行有多少个1

例如：

1 0 1 1 sum[j]的记录就是： 1 0 1 1

1 0 0 1 2 0 0 2

0 0 0 1 0 0 0 3

然后对num[j]从大到小排一下，求出读取到当前行能够得到的最大面积。

也就是最右边放着最多的1，依次类推。那么当前最大的面积就是 MAX（max,sum[j]*(j+1)）了

转载于:https://www.cnblogs.com/lzmfywz/articles/2356888.html

HDU OJ Matrix Swapping II相关推荐

HDU 2830 Matrix Swapping II
暴力枚举+DP预处理. 可以枚举矩形底边是哪一行,枚举到一行的时候,计算以该行为底边,最大矩形面积是多少. #include<cstdio> #include<cstring> ...
HDU OJ 动态规划46题解析
Robberies http://acm.hdu.edu.cn/showproblem.php?pid=2955 背包;第一次做的时候把概率当做背包(放大100000倍化为整数):在此范围内最多能抢 ...
hdu A + B Problem II(大数相加，数组实现)
hdu A + B Problem II(大数相加,数组实现) 题目走起注意最后一个case 不需要换行下面代码 #include<stdio.h> #include<strin ...
hdu 6149 Valley Numer II(01背包套状压dp)
题目链接:hdu 6149 Valley Numer II 题意: 给你N个点,有k个为高点,其他为低点,现在这N个点有m条边,问你最多能组成多少个两个高点一个低点,低点和两个高点都有边相连这样的状态 ...
[C#] 逆袭——自制日刷千题的AC自动机攻克HDU OJ
前言做过杭电.浙大或是北大等ACM题库的人一定对"刷题"不陌生,以杭电OJ为例:首先打开首页(http://acm.hdu.edu.cn/),然后登陆,接着找到"Onl ...
HDU - 2639 Bone Collector II
HDU - 2639 Bone Collector II dp之难,难于上青天. The title of this problem is familiar,isn't it?yeah,if you ...
LeetCode:Spiral Matrix I II
Spiral Matrix Given a matrix of m x n elements (m rows, n columns), return all elements of the matri ...
hdu 1023 Train Problem II
题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=1212 Train Problem II Description As we all know the ...
Spiral Matrix I II
Spiral Matrix I Given an integer n, generate a square matrix filled with elements from 1 to n^2 in s ...

最新文章

热门文章