【HDOJ】1510 White Rectangles

这个题目很好，变形的题目也很多。简单DP。

 /* 1510 */
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>

 #define MAXN 105

 char map[MAXN][MAXN];
 int dp[MAXN][MAXN];

 int min(int a, int b) {
     return a<b ? a:b;
 }

 int main() {
     int n;
     int i, j, k, tmp;
     int sum;

     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
     #endif

     while (scanf("%d", &n) != EOF) {
         for (i=; i<=n; ++i)
             scanf("%s", map[i]+);

         sum = ;
         for (i=; i<=n; ++i) {
             for (j=; j<=n; ++j) {
                 if (map[i][j] == '#') {
                     dp[i][j] = ;
                 } else {
                     dp[i][j] = dp[i-][j] + ;
                     tmp = dp[i][j];
                     sum += tmp;
                     for (k=j-; k>; --k) {
                         tmp = min(tmp, dp[i][k]);
                         sum += tmp;
                     }
                 }
             }
         }
         printf("%d\n", sum);
     }

     return ;
 }