四分树好像是个大冷门。。。
#include<iostream>
#include<queue>
#include<cstdio>
#include<cstring>
using namespace std;
#define maxn 520
char mp[maxn][maxn];
int n;
struct node
{
string data;
node * next[4];
node()
{
data.clear();
memset(next, NULL, sizeof(next));
}
}*root;
queue<node *> q;
int cal(int x, int y, int size)
{
int re1 = 0, re2 = 0;
for(int i = x; i < x+size; i++)
{
for(int j = y; j < y+size; j++)
{
if(mp[i][j] == '1')
re1++;
else re2++;
}
}
if(re1 == 0)return 0;
if(re2 == 0)return 1;
return