10x10的黑白格,计算相邻黑白格的最大面积


#include <iostream>
#include <math.h>
#include <tuple>
#include <utility>
#include <vector>
constexpr int len = 10;
// black is true, white is false;
#define BLACK (true)
#define  WHITE (false)
using COLOR = bool;
COLOR panes[len][len] = {WHITE};
int history[len][len] = {0};

inline bool calculatedBefore(int i, int j) {
    if (history[i][j] > 0 ) {
        return true;
    } else {
        return false;
    }
}

inline bool passedBefore(bool * roadpass, int i, int j) {
    if (roadpass[i*len + j] == true) {
        return true;
    }
    return false;
}

int calculate_node(int i, int j, bool * roadpass, COLOR color, std::vector<std::pair<int, int>> & vec) {
    if (i < 0 || i >= len || j < 0 || j >= len) {
        return 0;
    }
    if (passedBefore(roadpass, i, j)) {
        return 0;        
    }
    roadpass[i*len+j] = true;
    COLOR mycolor = panes[i][j];
    if(mycolor != color) {
        return 0;
    }
    vec.push_back({i,j});
    auto left = calculate_node(i-1, j, roadpass, color, vec);
    auto right = calculate_node(i+1, j, roadpass, color, vec);
    auto top = calculate_node(i, j-1, roadpass, color, vec);
    auto bottom = calculate_node(i, j+1, roadpass, color, vec);
    return 1+left+right+top+bottom;
}

void addHistory(std::vector<std::pair<int, int>> & vec, int num) {
    for(auto &item : vec) {
        assert(history[item.first][item.second] == 0);
        history[item.first][item.second] =  num;
    }
}

std::tuple<int, bool> calculate() {
    int max = 0;
    COLOR color = WHITE;
    std::vector<std::pair<int, int>> vec;
    for (int i = 0; i < len; i++) {
        for (int j = 0; j < len; j++) {
            if (calculatedBefore(i, j)) continue;
            bool roadpass[len][len] = {false};
            vec.clear();
            auto blacknum = calculate_node(i, j, &roadpass[0][0], BLACK, vec);
            addHistory(vec, blacknum);
            vec.clear();
            bool roadpass_w[len][len] = {false};
            auto whitenum = calculate_node(i, j, &roadpass_w[0][0], WHITE, vec);
            addHistory(vec, whitenum);
            if (max < blacknum) {
                max = blacknum;
                color = BLACK;
            }
            if (max < whitenum) {
                max = whitenum;
                color = WHITE;
            }
        }
    }
    return std::make_tuple(max, color);
}

void genpanes() {
    for (int i =0; i < len; i++)
        for (int j =0; j < len; j++) {
            if (i == j) {
                panes[i][j] = BLACK;
            }
            if (i == (len-1-j)) {
                panes[i][j] = BLACK;  
            }
        }
}

void printhistory() {
    std::cout << "history" << std::endl;
    for (int i = 0; i < len; i++) {
        for (int j =0; j < len; j++) {
            std::cout << history[i][j] << " ";
        }
        std::cout << std::endl;
    }
}

void printpanes() {
    std::cout << "panes" << std::endl;
    for (int i = 0; i < len; i++) {
        for (int j =0; j < len; j++) {
            std::cout << panes[i][j] << " ";
        }
        std::cout << std::endl;
    }
}
int main() {
    genpanes();   
    auto [num, color] = calculate();
    std::cout << "color = " << color << ", num = " << num << std::endl;
    printpanes();
    printhistory();
    return 0;
}

结果:

color = 0, num = 20
panes
1 0 0 0 0 0 0 0 0 1 
0 1 0 0 0 0 0 0 1 0 
0 0 1 0 0 0 0 1 0 0 
0 0 0 1 0 0 1 0 0 0 
0 0 0 0 1 1 0 0 0 0 
0 0 0 0 1 1 0 0 0 0 
0 0 0 1 0 0 1 0 0 0 
0 0 1 0 0 0 0 1 0 0 
0 1 0 0 0 0 0 0 1 0 
1 0 0 0 0 0 0 0 0 1 
history
1 20 20 20 20 20 20 20 20 1 
20 1 20 20 20 20 20 20 1 20 
20 20 1 20 20 20 20 1 20 20 
20 20 20 1 20 20 1 20 20 20 
20 20 20 20 4 4 20 20 20 20 
20 20 20 20 4 4 20 20 20 20 
20 20 20 1 20 20 1 20 20 20 
20 20 1 20 20 20 20 1 20 20 
20 1 20 20 20 20 20 20 1 20 
1 20 20 20 20 20 20 20 20 1 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值