HDOJ 题目2830 Matrix Swapping II（动态规划）

最新推荐文章于 2018-07-03 20:57:43 发布

Jogging_Clown

最新推荐文章于 2018-07-03 20:57:43 发布

阅读量459

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/yu_ch_sh/article/details/41285697

版权

动态规划专栏收录该内容

194 篇文章 0 订阅

订阅专栏

Matrix Swapping II

Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1299 Accepted Submission(s): 865

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

Note: Huge Input, scanf() is recommended.

Source

2009 Multi-University Training Contest 2 - Host by TJU

Recommend

gaojie | We have carefully selected several similar problems for you: 2577 1159 1978 1158 1227

ac代码

#include<stdio.h>
#include<string.h>
int num[1010],hash[1010];
int main()
{
	int n,m;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		int i,j,max=0;
		char c;
		for(i=0;i<n;i++)
		{
			getchar();
			memset(hash,0,sizeof(hash));
			for(j=0;j<m;j++)
			{
				scanf("%c",&c);
				if(c=='1')
					num[j]++;
				else
					num[j]=0;
				hash[num[j]]++;
			}
			for(j=1008;j>=0;j--)
			{
				hash[j]+=hash[j+1];
				if(hash[j]*j>max)
					max=hash[j]*j;
			}
		}
		printf("%d\n",max);
	}
}