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

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

2.代码：

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<cassert>
#include<string>
#include<sstream>
#include<set>
#include<vector>
#include<stack>
#include<map>
#include<queue>
#include<deque>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<functional>
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 <int, int> 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