Codeforces 375B/376D Maximum Submatrix 2 排序,dp

不错的一个题.

题意

给一个01矩阵,可以交换其中任意行,求最大的全1子矩阵的大小.

题解

首先定义数组pre[i][j]是从第$i$行第$j$列向左延伸能够产生的最多$1$的个数.
然后枚举列,把这一列的$pre$数组的值从大到小排序,然后相当于对每一列都求一个最大子矩形,而根据值单调递减,可以不用单调栈,而直接用$pre[i][j]\times i$计算(每一行上面的那一行大于等于它,不可能影响),并维护最大值即可.

#include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rec register char
#define rel register ll
#define gc getchar
#define pc putchar
#define p32 pc(' ')
#define pl puts("")
/*By Citrus*/
inline int read(){
  int x=0,f=1;char c=gc();
  for (;!isdigit(c);c=gc()) f^=c=='-';
  for (;isdigit(c);c=gc()) x=(x<<3)+(x<<1)+(c^'0');
  return f?x:-x;
  }
template <typename mitsuha>
inline bool read(mitsuha &x){
  x=0;int f=1;char c=gc();
  for (;!isdigit(c)&&~c;c=gc()) f^=c=='-';
  if (!~c) return 0;
  for (;isdigit(c);c=gc()) x=(x<<3)+(x<<1)+(c^'0');
  return x=f?x:-x,1;
  }
template <typename mitsuha>
inline int write(mitsuha x){
  if (!x) return 0&pc(48);
  if (x<0) x=-x,pc('-');
  int bit[20],i,p=0;
  for (;x;x/=10) bit[++p]=x%10;
  for (i=p;i;--i) pc(bit[i]+48);
  return 0;
  }
inline char fuhao(){
  char c=gc();
  for (;isspace(c);c=gc());
  return c;
  }
}using namespace chtholly;
using namespace std;
const int aoi=5013;
char c[aoi][aoi];
int pre[aoi][aoi],llx,tmp[aoi];
int main(){
int i,j,n=read(),m=read();
for (i=1;i<=n;++i) scanf("%s",c[i]+1);
for (i=1;i<=n;++i){
  for (j=1;j<=m;++j) pre[i][j]=c[i][j]=='0'?0:pre[i][j-1]+1;
  }
for (j=1;j<=m;++j){
  for (i=1;i<=n;++i) tmp[i]=pre[i][j];
  sort(tmp+1,tmp+n+1,greater<int>());
  for (i=1;i<=n;++i) llx=max(llx,tmp[i]*i);
  }write(llx);
}

谢谢大家.