UVA 12265 Selling Land

题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=65530#problem/S

解题思路：递推+单调栈。具体思路见紫书。

#include <ctime>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <utility>
#include <algorithm>
#include <functional>
using namespace std;
const int maxn = 1010;
char s[maxn][maxn];
int a[maxn][maxn], h[maxn][maxn];
map<int, int> mp;
stack< pair<int,int> > stk;

int main() {

    //freopen("aa.in", "r", stdin);
    int T, n, m;
    scanf("%d", &T);
    while(T--) {
        mp.clear();
        scanf("%d %d", &n, &m);
        for(int i = 0; i < n; ++i) {
            scanf("%s", s[i]);
        }
        for(int i = 0; i < n; ++i) {
            for(int j = 0; j < m; ++j) {
                if(s[i][j] == '.') {
                    a[i+1][j+1] = 1;
                } else {
                    a[i+1][j+1] = 0;
                }
            }
        }
        for(int i = 1; i <= n; ++i) {
            while(!stk.empty()) stk.pop();
            for(int j = 1; j <= m; ++j) {
                h[i][j] = (a[i][j] == 1 ? h[i-1][j] + 1 : 0);
                if(h[i][j] == 0) {
                    while(!stk.empty()) stk.pop();
                    continue;
                }
                if(stk.empty()) {
                    stk.push(make_pair(j, h[i][j]));
                } else {
                    if(h[i][j] >= stk.top().second) {
                        if(h[i][j]-j > stk.top().second - stk.top().first) {
                            stk.push(make_pair(j, h[i][j]));
                        }
                    } else {
                        int p = i;
                        while(!stk.empty() && stk.top().second >= h[i][j]) {
                            p = stk.top().first;
                            stk.pop();
                        }
                        if(stk.empty()) stk.push(make_pair(p, h[i][j]));
                        else {
                            if(h[i][j]-p > stk.top().second - stk.top().first) {
                                stk.push(make_pair(p, h[i][j]));
                            }
                        }
                    }
                }
                mp[2*(j-stk.top().first+1+stk.top().second)]++;
            }
        }
        /*
        for(int i = 1; i <= n; ++i) {
            for(int j = 1; j <= m; ++j) {
                printf("%d ", h[i][j]);
            }
            printf("\n");
        }
        */
        for(auto it = mp.begin(); it != mp.end(); ++it) {
            printf("%d x %d\n", it->second, it->first);
        }
    }
    return 0;
}