Topcoder SRM 636 div2 1000

可能个人的代码简写方式和大家的有点不同，读起来有点不适应，还望正在读此篇博客的acmer多多包涵！

#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
using namespace std;
#define pb push_back
#define mp make_pair
#define rep(i,a,n) for(int i=a;i<(n);++i)
#define repp(i,a,n) for(int i = a;i<=(n);++i)
#define For(i,l,h) for(int i=(l);i>(h);--i)
#define Forr(i,h,l) for(int i=(h);i>=(l);--i)
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<double> vd;
typedef long long ll;
typedef pair<int,int> pii;

int n, m;
int sum[80][80];
bool check(int x){
    int flag;
    repp(ia, 1, n)repp(ib, ia+1, n)repp(ic, ib + 1, n){
        int p = 0;
        flag = 0;
        repp(j, 1, m){
            if(sum[ia][j] - sum[ia][p] >= x && sum[ib][j] - sum[ib][p] - sum[ia][j] + sum[ia][p] >= x && sum[ic][j] - sum[ic][p] - sum[ib][j] + sum[ib][p] >= x && sum[n][j] - sum[n][p] - sum[ic][j] + sum[ic][p] >= x){
                flag++;
                p = j;
            }
        }
        if(flag>=4)return 1;
    }
    return 0;
}

class ChocolateDividingHard
{
        public:
        int findBest(vector <string> ch)
        {
            n = ch.size();
            m = ch[0].size();
            repp(i, 1, n){
                repp(j, 1, m){
                        sum[i][j] = ch[i-1][j-1] - '0';
                }
            }
            repp(i, 1, n){
                repp(j, 1, m){
                    sum[i][j] += sum[i-1][j];
                }
            }
            repp(i, 1, n){
                repp(j, 1, m){
                    sum[i][j] += sum[i][j-1];
                }
            }
            int lc = 0, rc = sum[n][m] + 1;
            while(lc+1<rc){
                int mid = (lc+rc)>>1;
                if(check(mid))lc = mid;
                else rc = mid;

            }
            return lc;
        }
};