修改后的代码段,原来是替换数组的时候没把输出的数组在while循环一次的结尾清空掉,导致数据保留了
#include<iostream>
int board_width;
int mark1[10][10];
int mark[10][10];
int map[10][10];
int map1[10][10]={0};
int tail[10]={0};
struct tagInfo
{
int event;
int dir;
int col;
int val[2];
}tInfo;
struct Point
{
int x;
int y;
};
Point drop[1000];
void newBlock(int block[2])
{
tInfo.event=1;
tInfo.dir=0;
tInfo.col=0;
tInfo.val[0]=block[0];
tInfo.val[1]=block[1];
}
void rotate(int angle)
{
tInfo.dir=(tInfo.dir+angle)%4;
if(tInfo.dir==0&&tInfo.col==board_width-1)
{
tInfo.col=board_width-2;
}
if(tInfo.dir==2&&tInfo.col==0)
{
tInfo.col=1;
}
}
void move(int distance)
{
tInfo.col+=distance;
if(tInfo.col>=1&&tInfo.col<=board_width-2) return;
if(tInfo.dir==0&&tInfo.col==board_width-1)
{
tInfo.col=board_width-2;
return;
}
if(tInfo.dir==2&&tInfo.col<=0)
{
tInfo.col=1;
return;
}
if(tInfo.col>board_width-1)
{
tInfo.col=board_width-1;
return;
}
if(tInfo.col<0)
{
tInfo.col=0;
return;
}
}
void hinder(int count,int life)
{
tInfo.event=2;
for(int i=0;i<count;i++)
{
map[i][tail[i]++]=-1*life;
}
}
void init(int width)
{
board_width=width;
for(int i=0;i<board_width;i++)
{
tail[i]=0;
}
}
dfs(int x,int y,int num)
{
if(map[x-1][y]==map[x][y]&&mark1[x-1][y]==0)
{
mark1[x-1][y]=1;
num=dfs(x-1,y,num)+1;
}
if(map[x][y+1]==map[x][y]&&mark1[x][y+1]==0)
{
mark1[x][y+1]=1;
num=dfs(x,y+1,num)+1;
}
if(map[x+1][y]==map[x][y]&&mark1[x+1][y]==0)
{
mark1[x+1][y]=1;
num=dfs(x+1,y,num)+1;
}
if(map[x][y-1]==map[x][y]&&mark1[x][y-1]==0)
{
mark1[x][y-1]=1;
num=dfs(x,y-1,num)+1;
}
return num;
}
void mark2(int x,int y)
{
for(int i=0;i<board_width;i++)
{