在讲分治算法中,我先讲了简单的二分法.现在让我们来看看小问题的规模更多,更大的情况.
残缺棋盘问题:
一个棋盘,有2^k * 2^k个格,在这些格中有一个格是坏的,我们希望用三种形状的缺口2*2的正方形将整个残缺棋盘覆盖,我们应该怎么做呢,这个需要画图来理解.(出于时间的原因,我就不画了,题目自己去找)
我给出我运行成功的代码:
#include"stdio.h"
int Board[100][100]={0};
int amount=0;
int main()
{
int k,size,x,y;
void Cover(int tr,int tc,int dr,int dc,int size);
void OutputBoard(int size);
scanf("%d",&k);
size=1<<k;
printf("input incomplete pane");
scanf("%d %d",&x,&y);
Cover(0,0,x,y,size);
OutputBoard(size);
return 0;
}
void Cover(int tr,int tc,int dr,int dc,int size)
{
int s,t;
if(size<2) return;
amount=amount+1;
t=amount;
s=size/2;
if(dr<tr+s && dc< tc+s)
{
Cover(tr,tc,dr,dc,s);
Board[tr+s-1][tc+s]=t;
Board[tr+s][tc+s-1]=t;
Board[tr+s][tc+s]=t;
Cover(tr,tc+s,tr+s-1,tc+s,s);
Cover(tr+s,tc,tr+s,tc+s-1,s);
Cover(tr+s,tc+s,tr+s,tc+s,s);
}
else if(dr<tr+s && dc>=tc+s)
{
Cover(tr,tc+s,dr,dc,s);
Board[tr+s-1][tc+s-1]=t;
Board[tr+s][tc+s-1]=t;
Board[tr+s][tc+s]=t;
Cover(tr,tc,tr+s-1,tc+s-1,s);
Cover(tr+s,tc,tr+s,tc+s-1,s);
Cover(tr+s,tc+s,tr+s,tc+s,s);
}
else if(dr>=tr+s && dc<tc+s)
{
Cover(tr+s,tc,dr,dc,s);
Board[tr+s-1][tc+s-1]=t;
Board[tr+s-1][tc+s]=t;
Board[tr+s][tc+s]=t;
Cover(tr,tc,tr+s-1,tc+s-1,s);
Cover(tr,tc+s,tr+s-1,tc+s,s);
Cover(tr+s,tc+s,tr+s,tc+s,s);
}
else if(dr>=tr+s && dc>=tc+s)
{
Cover(tr+s,tc+s,dr,dc,s);
Board[tr+s-1][tc+s-1]=t;
Board[tr+s-1][tc+s]=t;
Board[tr+s][tc+s-1]=t;
Cover(tr,tc,tr+s-1,tc+s-1,s);
Cover(tr+s,tc+s,tr+s-1,tc+s,s);
Cover(tr+s,tc+s,tr+s,tc+s-1,s);
}
}
void OutputBoard(int size)
{
for(int i=0;i<size;i++)
{
for(int j=0;j<size;j++)
printf("%3d ",Board[i][j]);
printf("/n");
}
}
有什么问题的话,可以留言,我会及时回答的