棋盘覆盖问题——分治思想

// 棋盘覆盖问题__分治法
#include <iostream>
#include <vector>
#include <iomanip>
using namespace std;
static int t = 0;
vector<vector<int>> board;

void Chess(int tr, int tc, int dr, int dc, int size)
{
    int s;
    int t1;
    if (size == 1)
        return;
    s = size / 2;
    t1 = ++t;

    // 特殊方格在左上角
    if (dr < tr + s && dc < tc + s)
    {
        Chess(tr, tc, dr, dc, s);
    }
    else
    {
        board[tr + s - 1][tc + s - 1] = t1;
        Chess(tr, tc, tr + s - 1, tc + s - 1, s);
    }

    // 特殊方格在右上角
    if (dr < tr + s && dc >= tc + s)
    {
        Chess(tr, tc + s, dr, dc, s);
    }
    else
    {
        board[tr + s - 1][tc + s] = t1;
        Chess(tr, tc + s, tr + s - 1, tc + s, s);
    }

    // 特殊方格在右下角
    if (dr >= tr + s && dc >= tc + s)
    {
        Chess(tr + s, tc + s, dr, dc, s);
    }
    else
    {
        board[tr + s][tc + s] = t1;
        Chess(tr + s, tc + s, tr + s, tc + s, s);
    }

    // 特殊方格在左下角
    if (dr >= tr + s && dc < tc + s)
    {
        Chess(tr + s, tc, dr, dc, s);
    }
    else
    {
        board[tr + s][tc + s - 1] = t1;
        Chess(tr + s, tc, tr + s, tc + s - 1, s);
    }
}


int main()
{
    int x, y, n;
    cin >> x >> y >> n;
    // 初始化棋盘
    board = vector<vector<int>>(n, vector<int>(n, 0));

    Chess(0, 0, x - 1, y - 1, n);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            cout << setw(4) << board[i][j];
        }
        cout << endl;
    }
    return 0;
}