java棋盘覆盖分治法_利用分治法解决棋盘覆盖问题

标签：分治法

1.问题描述：点击打开链接

2.代码：

#define _CRT_SECURE_NO_WARNINGS

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

using namespace std;

#define me(s) memset(s,0,sizeof(s))

#define pb push_back

typedef long long ll;

typedef unsigned int uint;

typedef unsigned long long ull;

typedef pair P;

const int N = 1 << 11;

int A[N][N];

int n, a, b;

int idx;

void solve(int r1, int r2, int c1, int c2, int x, int y)

{

if (r2-r1==1)return;

int t = idx++;

int mr = (r1 + r2)/2, mc = (c1 + c2)/2;

if (x

else solve(r1, mr, r2, mc, mr-1,mc-1), A[mr-1][mc-1] = t;

if (x= mc)solve(r1, mr, mc, c2, x, y);

else solve(r1, mr, mc, c2, mr-1,mc), A[mr-1][mc] = t;

if (x >= mr&&y

else solve(mr, r2, c1, mc, mr,mc-1), A[mr][mc-1] = t;

if (x >= mr&&y >= mc)solve(mr, r2, mc, c2, x, y);

else solve(mr, r2, mc, c2, mr,mc), A[mr][mc] = t;

}

int main()

{

while (~scanf("%d%d%d", &n, &a, &b))

{

me(A); idx = 1;

solve(0, (1 << n), 0, (1 << n), a - 1, b - 1);

A[a - 1][b - 1] = 0;

for (int i = 0; i

{

for (int j = 0; j

{

printf("%2d%c", A[i][j], " \n"[j == (1 << n) - 1]);

}

puts("");

}

}

}

版权声明：本文为博主原创文章，未经博主允许不得转载。

标签：分治法

原文：http://blog.csdn.net/u014800748/article/details/47754161