希望更丰富的展现？使用Markdown
by 硫酸钒酰 @ 2018-10-19 21:35:18
帮你一下吧
by 嚯呀嚯呀 @ 2018-10-19 21:35:48
```
include<iostream>
using namespace std;
int n,map[5001][5001]={0},maxn=0,total;
char input;
int dfs(int x,int y)
{
if(map[x-1][y-2]==map[x-2][y-1]&&map[x-1][y-2]==map[x+1][y-2]&&map[x-1][y-2]==map[x+2][y-1]&&map[x-1][y-2]==map[x-1][y+2]&&map[x-1][y-2]==map[x-2][y+1]&&map[x-1][y-2]==map[x+1][y+2]&&map[x-1][y-2]==map[x+2][y+1]&&map[x-1][y-2]==0)
{
map[x][y]=1;
map[x-1][y-2]=map[x-2][y-1]=map[x+1][y-2]=map[x+2][y-1]=map[x-1][y+2]=map[x-2][y+1]=map[x+1][y+2]=map[x+2][y+1]=1;
total++;
if(maxn<total)maxn=total;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(map[i][j]==0)
dfs(i,j);
map[x-1][y-2]=map[x-2][y-1]=map[x+1][y-2]=map[x+2][y-1]=map[x-1][y+2]=map[x-2][y+1]=map[x+1][y+2]=map[x+2][y+1]=0;
}
}
map[x][y]=0;
return 1;
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
cin>>input;
map[i][j]=input-48;
}
}
for(int s=1;s<=n;s++)
{
for(int b=1;b<=n;b++)
{
total=0;
if(map[s][b]==0)
dfs(s,b);
}
}
cout<<maxn<<endl;
return 0;
}
```
by 嚯呀嚯呀 @ 2018-10-19 21:36:06
@[情谊、暴走](/space/show?uid=115923)
是
```cpp
#include<iostream>
```
吧……
by 硫酸钒酰 @ 2018-10-19 21:37:31
@[嚯呀嚯呀](/space/show?uid=39488) 你这个样例都错呀
by 月落落落 @ 2018-10-19 21:37:53
@[Max雷](/space/show?uid=84986)
我在提交时是
#include<iostream>
的
by 情谊、暴走 @ 2018-10-19 21:40:30
推荐使用markdown
推荐使用插入代码功能
by 戦艦はるな @ 2018-10-19 21:44:50
嗯嗯嗯
by UhhhQQQU @ 2018-10-19 21:47:17
抢我们家江晚吟
by 魔道祖师 @ 2018-10-19 21:55:14
@[Nephren](/space/show?uid=52587)
markdown怎么用
by 情谊、暴走 @ 2018-10-19 21:55:15