暴力/DP Codeforces Beta Round #22 (Div. 2 Only) B. Bargaining Table

题目传送门

 /*
     题意：求最大矩形(全0)的面积
     暴力/dp：每对一个0查看它左下的最大矩形面积，更新ans
     注意：是字符串，没用空格，好事多磨，WA了多少次才发现:(
     详细解释：http://www.cnblogs.com/cszlg/p/3217478.html
 */
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <cmath>
 using namespace std;

 const int MAXN = ;
 const int INF = 0x3f3f3f3f;
 char s[MAXN][MAXN];
 int n, m;

 int get_sum(int x, int y)
 {
     int res = ;    int d, w = ;
     for (int i=x; i<n; ++i)
     {
         if (s[i][y] == '')    break;
         int j = y + ;
         while (j < m && s[i][j] == '')    ++j;
         d = i - x + ;
         if (w > j - y)    w = j - y;
         res = max (res, (w + d) * );
     }

     return res;
 }

 int main(void)        //Codeforces Beta Round #22 (Div. 2 Only) B. Bargaining Table
 {
     while (scanf ("%d%d", &n, &m) == )
     {
         for (int i=; i<n; ++i)
         {
             scanf ("%s", s[i]);
         }

         int ans = ;
         for (int i=; i<n; ++i)
         {
             for (int j=; j<m; ++j)
             {
                 if (s[i][j] == '')
                 {
                     ans = max (ans, get_sum (i, j));
                 }
             }
         }

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

     return ;
 }