UVALive - 4324 Ugly Windows 水题＋坑题

题目大意：给出n行m列的字符串，要求你找出里面能构成矩形的字母，并按字典序输出

解题思路：枚举起点和终点，看能否构成矩形，坑点就是，矩形的长宽都要大于等于3….

#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 110
using namespace std;

struct Node{
    int start_x, start_y, end_x, end_y;
}node[27];

char str[maxn][maxn], ans[27];
int vis_a[27];

int main() {
    int n, m;
    while(scanf("%d%d", &n, &m) == 2 && n + m) {
        for(int i = 0; i < n; i++)
            scanf("%s", str[i]);

        memset(vis_a,0,sizeof(vis_a));
        int cnt = 0;    
        for(int i = 0; i < n; i++)
            for(int j = 0; j < m; j++)
                if(str[i][j] != '.') {
                    int t = str[i][j] - 'A';
                    if(!vis_a[t]) {
                        vis_a[t] = 1;
                        ans[cnt++] = str[i][j];
                        node[t].start_x = node[t].end_x = i;
                        node[t].start_y = node[t].end_y = j;
                    }
                    else {
                        node[t].start_x = min(node[t].start_x, i);
                        node[t].start_y = min(node[t].start_y, j);
                        node[t].end_x = max(node[t].end_x, i);
                        node[t].end_y = max(node[t].end_y, j);
                    }   
                }

        sort(ans,ans+cnt);
        for(int i = 0; i < cnt; i++) {
            int t = ans[i] - 'A';
            bool flag = true;
            for(int j = node[t].start_x; j <= node[t].end_x; j++) {
                for(int k = node[t].start_y ; k <= node[t].end_y; k++)
                    if((j == node[t].start_x || j == node[t].end_x || k == node[t].start_y || k == node[t].end_y) && str[j][k] != ans[i]) {
                        flag = false;
                        break;
                    }
                    else if(j != node[t].start_x && j != node[t].end_x && k != node[t].start_y && k != node[t].end_y && str[j][k] != '.') {
                        flag = false;
                        break;
                    }
                if(!flag)
                    break;
            }
            if(flag && node[t].start_x + 1 < node[t].end_x && node[t].start_y + 1 < node[t].end_y)
                printf("%c",ans[i]);
        }
        printf("\n");
    }
    return 0;
}