UVa10502 - Counting Rectangles

#include <cstdio>
#include <cstring>

using namespace std;

const int N = 100;

short g[N][N];
bool check(int x1, int y1, int x2, int y2);

int main()
{
    int n, m;
    char ch;
    int x1, y1, x2, y2;
    int cnt;

#ifndef ONLINE_JUDGE
    freopen("uva_in.txt", "r", stdin);
#endif

    while (scanf("%d", &n) && n) {
        scanf("%d", &m);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; ) {
                ch = getchar();
                    if (ch == '0' || ch == '1') {
                        g[i][j++] = ch - '0';
                    }
            }
        }
        
        cnt = 0;
        for (x1 = 0; x1 < n; x1++) {
            for ( y1 = 0; y1 < m; y1++) {
                for (x2 = x1; x2 < n; x2++) {
                    for (y2 = y1; y2 < m; y2++) {
                        if (check(x1, y1, x2, y2)) cnt++;        
                    }
                }
            }
        }

        printf("%d\n", cnt);
    }
    return 0;
}

bool check(int x1, int y1, int x2, int y2) 
{
    for (int i = x1; i <= x2; i++) {
        for (int j = y1; j <= y2; j++) {
            if (g[i][j] != 1) return false;
        }
    }

    return true;
}



上面用的是枚举法,效率不高,改成组合的计数方法,代码如下

#include <cstdio>
#include <algorithm>
#include <climits>

using namespace std;

#pragma warning(disable:4996)

const int N = 110;

int dp[N][N];
int row, col;
char buf[N];

bool input()
{
	scanf("%d", &row);
	if (row == 0) return false;

	scanf("%d", &col);
	for (int i = 1; i <= row; i++) {
		scanf("%s", buf);
		for (int j = 1; j <= col; j++) {
			if (buf[j - 1] == '1') dp[i][j] = 1;
			else dp[i][j] = 0;
		}
	}
	return true;
}



void solve()
{
	for (int i = 2; i <= row; i++) {
		for (int j = 1; j <= col; j++) {
			if (dp[i][j]) dp[i][j] += dp[i - 1][j];
		}
	}

	int ans = 0;
	for (int i = 1; i <= row; i++) {
		for(int j = 1; j <= col; j++) {
			int tmp = INT_MAX;
			for (int k = j; k <= col && dp[i][k]; k++) {
				tmp = min(tmp, dp[i][k]);
				ans += tmp;
			}
		}
	}

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

int main()
{
#ifndef ONLINE_JUDGE
	freopen("f:\\OJ\\uva_in.txt", "r", stdin);
#endif

	while (input()) {
		solve();
	}

	return 0;
}


评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

kgduu

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值