TOJ 3667 HDU 2830 Matrix Swapping II

最新推荐文章于 2014-11-25 16:58:58 发布

芋智波佐助

最新推荐文章于 2014-11-25 16:58:58 发布

阅读量837

点赞数

分类专栏：普通DP

本文链接：https://blog.csdn.net/u011686226/article/details/10120989

版权

普通DP 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

Matrix Swapping II

时间限制(普通/Java):1000MS/3000MS 运行内存限制:65536KByte

描述

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.

输入

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 one line for each test case, indicating the maximum possible goodness.

样例输入

样例输出

4
2

自己想不到是参考别人的

主要是那个排序排序了就可以枚举了

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
#define MAX 1010

char str[MAX];
int dp[MAX];
int a[MAX];

bool cmp(int x,int y)
{
	return x>y;
}

int main()
{
	int n,m,max,i,j;
	while(scanf("%d %d",&n,&m)!=EOF)
	{
		max= -1;
		memset(a,0,sizeof(a));
		for(i = 1; i<= n; i++)
		{
			scanf("%s",str+1);
			for(j = 1;j <= m; j++)
			{
				if(str[j] == '1')
				{
					a[j]++;
				}
				else
				{
					a[j] = 0;
				}
				dp[j] = a[j];
			}
			sort(dp+1,dp+m+1,cmp);
			for(j = 1; j <= m; j++)
			{
				max = max > dp[j] * j ? max : dp[j] * j;
			}
		}
		printf("%d\n",max);
	}

}