I have tried running the topcoder arena in linux many times and have failed. Our university uses proxy server with following settings:

proxy: 10.3.100.207 port: 8080

I have configured OpenJDK settings and system settings. I have configured the arena proxy settings in many way, used all the 4 tunnels, but wasn't able to get it work. Lots of people in my college are regular participants in various contests like spoj/codeforces/codechef/hackerrank, but sadly we aren't able to participate in topcoder matches. Any one has a solution to it?

The question in short is: You are given a matrix consisting of digits zero and one, its size is n × m. You are allowed to rearrange its rows. What is the maximum area of the submatrix that only consists of ones and can be obtained in the given problem by the described operations?

Problem link: http://codeforces.me/contest/375/problem/B

Tutorial Link: http://codeforces.me/blog/entry/10084

I am having problem understanding the solution. It uses a right[i][j]=number of continuous 1s to the right of input[j][i] and then sorts the right matrix along the columns. I'm not sure how this works. Does sorting according to columns arrives at a particular permutation of rows? How does this work?