hdu 2830 Matrix Swapping II（额，，排序？）

int n,m;
char temps[1005][1005];
int a[1005][1005];
 int ts[1005];



bool cmp(int a,int b){
    return a>b;
}


int main(){

    while(scanf("%d%d",&n,&m)!=EOF){
        rep(i,0,n-1){
            scanf("%s",temps[i]);
        }
        mem(a,0);
        rep(i,0,m-1) if(temps[0][i]==‘0‘) a[0][i]=0; else a[0][i]=1;
        rep(i,1,n-1){
            rep(j,0,m-1){
                if(temps[i][j]==‘1‘) a[i][j]=1+a[i-1][j];
            }
        }

        int ans=0;
        rep(i,0,n-1){
            rep(j,0,m-1) ts[j]=a[i][j];
            sort(ts,ts+m,cmp);
            rep(i,0,m-1) ans=max( ans,ts[i]*(i+1) );
        }

        printf("%d\n",ans);
    }

    return 0;
}