📄 usaco 2_1_1 the castle 题解 usaco分析的翻译【原创翻译】_leokan的blog.mht
字号:
A=20
href=3D"http://hi.baidu.com/leokan/profile">=B8=F6=C8=CB=B5=B5=B0=B8</A> =
<SPAN>|</SPAN><A=20
href=3D"http://hi.baidu.com/leokan/friends">=BA=C3=D3=D1</A> =
<SPAN>|</SPAN><A=20
href=3D"http://hi.baidu.com/leokan/modify/spbasic/0">=C9=E8=D6=C3</A> =
</DIV></DIV>
<DIV class=3Dstage>
<DIV class=3Dstagepad>
<DIV style=3D"WIDTH: 100%">
<TABLE class=3Dmodth cellSpacing=3D0 cellPadding=3D0 width=3D"100%" =
border=3D0>
<TBODY>
<TR>
<TD class=3Dmodtl width=3D7> </TD>
<TD class=3Dmodtc noWrap>
<DIV class=3Dmodhead><SPAN =
class=3Dmodtit>=B2=E9=BF=B4=CE=C4=D5=C2</SPAN></DIV></TD>
<TD class=3Dmodtc noWrap align=3Dright>
<DIV class=3Dmodopt><A class=3Dmodact=20
href=3D"http://hi.baidu.com/leokan/creat/blog/"><IMG=20
src=3D"http://img.baidu.com/hi/img/ico_postnew.gif" =
align=3DabsMiddle=20
border=3D0>=D0=B4=D0=C2=CE=C4=D5=C2</A></DIV></TD>
<TD class=3Dmodtr width=3D7> </TD></TR></TBODY></TABLE>
<DIV class=3Dmodbox id=3Dm_blog>
<DIV class=3Dtit>USACO 2.1.1 The Castle =CC=E2=BD=E2 =
USACO=B7=D6=CE=F6=B5=C4=B7=AD=D2=EB=A1=BE=D4=AD=B4=B4=B7=AD=D2=EB=A1=BF</=
DIV>
<DIV class=3Ddate>2008=C4=EA01=D4=C227=C8=D5 =D0=C7=C6=DA=C8=D5 =
21:13</DIV>
<TABLE style=3D"TABLE-LAYOUT: fixed">
<TBODY>
<TR>
<TD>
<DIV class=3Dcnt>
<P><STRONG></STRONG></P>
<H2>USACO 2.1.1 The Castle</H2>
<DIV class=3Dt_msgfont>The Castle<BR>IOI'94 - Day 1 <BR>In a =
stroke of luck=20
almost beyond imagination, Farmer John was sent a ticket to the =
Irish=20
Sweepstakes (really a lottery) for his birthday. This ticket =
turned out to=20
have only the winning number for the lottery! Farmer John won a =
fabulous=20
castle in the Irish countryside. <BR><BR>Bragging rights being =
what they=20
are in Wisconsin, Farmer John wished to tell his cows all about =
the=20
castle. He wanted to know how many rooms it has and how big the =
largest=20
room was. In fact, he wants to take out a single wall to make an =
even=20
bigger room. <BR><BR>Your task is to help Farmer John know the =
exact room=20
count and sizes. <BR><BR>The castle floorplan is divided into M =
(wide) by=20
N (1 <=3DM,N<=3D50) square <SPAN class=3Dt_tag=20
href=3D"tag.php?name=3Dmod">mod</SPAN>ules. Each such <SPAN =
class=3Dt_tag=20
href=3D"tag.php?name=3Dmod">mod</SPAN>ule can have between zero =
and four=20
walls. Castles always have walls on their "outer edges" to keep =
out the=20
wind and rain. <BR><BR>Consider this annotated floorplan of a =
castle:=20
<BR><BR> 1 2 3 4 5 6=20
7<BR>#############################<BR>1 # | # | # | |=20
#<BR>#####---#####---#---#####---# <BR>2 # # | # # # #=20
#<BR>#---#####---#####---#####---#<BR>3 # | | # # # # #=20
<BR>#---#########---#####---#---#<BR>4 # -># | | | | # #=20
<BR>############################# <BR><BR># =3D Wall=20
-,| =3D No wall<BR>-> =3D Points =
to the wall=20
to remove to<BR> make the largest possible new=20
room<BR><BR>By way of example, this castle sits on a 7 x 4 base. A =
"room"=20
includes any set of connected "squares" in the floor plan. This =
floorplan=20
contains five rooms (whose sizes are 9, 7, 3, 1, and 8 in no =
particular=20
order). <BR><BR>Removing the wall marked by the arrow merges a =
pair of=20
rooms to make the largest possible room that can be made by =
removing a=20
single wall. <BR><BR>The castle always has at least two rooms and =
always=20
has a wall that can be removed. <BR><BR>PROGRAM NAME: =
castle<BR>INPUT=20
FORMAT<BR>The map is stored in the form of numbers, one number for =
each=20
module, M numbers on each of N lines to describe the floorplan. =
The input=20
order corresponds to the numbering in the example diagram above.=20
<BR><BR>Each module number tells how many of the four walls exist =
and is=20
the sum of up to four integers: <BR><BR>1: wall to the west <BR>2: =
wall to=20
the north <BR>4: wall to the east <BR>8: wall to the south =
<BR>Inner walls=20
are defined twice; a wall to the south in module 1,1 is also =
indicated as=20
a wall to the north in module 2,1. Line 1: Two =
space-separated=20
integers: M and N <BR>Line 2..: M x N integers, =
several per=20
line. <BR><BR><BR>SAMPLE INPUT (file castle.in) <BR>7 =
4<BR>11 6=20
11 6 3 10 6<BR>7 9 6 13 5 15 5<BR>1 10 12 7 13 7 5<BR>13 11 10 8 =
10 12=20
13<BR><BR>OUTPUT FORMAT<BR>The output contains several lines: Line =
1: The number of rooms the castle =
has. <BR>Line=20
2: The size of the largest room <BR>Line =
3: The=20
size of the largest room creatable by removing one=20
wall <BR>Line 4: The single wall to remove =
to make=20
the largest room possible <BR><BR><BR>Choose the optimal wall to =
remove=20
from the set of optimal walls by choosing the wall farthest to the =
west=20
(and then, if still tied, farthest to the south). Name that wall =
by naming=20
the module that borders it on either the west or south, along with =
a=20
direction of N or E giving the location of the wall with respect =
to the=20
module. <BR><BR>SAMPLE OUTPUT (file =
castle.out)<BR>5<BR>9<BR>16<BR>4 1=20
E<BR><BR><BR><BR>The Castle <BR><BR>=B3=C7=B1=A4<BR><BR>IOI'94 - =
Day 1 <BR><BR>=D2=EB by=20
tim=20
=
green<BR><BR><BR>=D2=D4=D2=BB=B8=F6=BC=B8=BA=F5=B3=AC=BA=F5=CF=EB=CF=F1=B5=
=C4=D4=CB=C6=F8=A3=AC=C5=A9=C3=F1=D4=BC=BA=B2=D4=DA=CB=FB=B5=C4=C9=FA=C8=D5=
=CA=D5=B5=BD=C1=CB=D2=BB=D5=C5=B0=AE=B6=FB=C0=BC=B2=A9=B2=CA=B5=C4=BD=B1=C8=
=AF=A1=A3<BR>=D5=E2=D2=BB=D5=C5=BD=B1=C8=AF=B3=C9=CE=AA=C1=CB=CE=A8=D2=BB=
=D6=D0=BD=B1=B5=C4=BD=B1=C8=AF=A1=A3<BR>=C5=A9=C3=F1=D4=BC=BA=B2=D9=F8=B5=
=C3=B0=AE=B6=FB=C0=BC=B5=C4=CF=E7=CF=C2=B5=D8=B7=BD=B5=C4=D2=BB=B8=F6=B4=AB=
=CB=B5=D6=D0=B5=C4=B3=C7=B1=A4=A1=A3<BR>=B4=B5=C5=A3=D4=DA=CB=FB=C3=C7=CD=
=FE=CB=B9=BF=B5=D0=C1=D6=DD=B2=BB=CB=E3=CA=B2=C3=B4=A3=AC=C5=A9=C3=F1=D4=BC=
=BA=B2=CF=EB=B8=E6=CB=DF=CB=FB=B5=C4=C5=A3=CB=F9=D3=D0=D3=D0=B9=D8=B3=C7=B1=
=A4=B5=C4=CA=C2=A1=A3<BR>=CB=FB=CF=EB=D6=AA=B5=C0=B3=C7=B1=A4=D3=D0=B6=E0=
=C9=D9=B7=BF=BC=E4=A3=AC=B6=F8=C7=D2=D7=EE=B4=F3=B5=C4=B7=BF=BC=E4=D3=D0=B6=
=E0=B4=F3=A1=A3<BR>=CA=C2=CA=B5=C9=CF=A3=AC=CB=FB=CF=EB=C8=A5=B5=F4=D2=BB=
=C3=E6=C7=BD=C0=B4=D6=C6=D4=EC=D2=BB=B8=F6=B8=FC=B4=F3=B5=C4=B7=BF=BC=E4=A1=
=A3<BR><BR>=C4=E3=B5=C4=C8=CE=CE=F1=CA=C7=B0=EF=D6=FA=C5=A9=C3=F1=D4=BC=BA=
=B2=C8=A5=C1=CB=BD=E2=D5=FD=C8=B7=B7=BF=BC=E4=CA=FD=C4=BF=BA=CD=B4=F3=D0=A1=
=A1=A3<BR>=B3=C7=B1=A4=B5=C4=C6=BD=C3=E6=CD=BC=B1=BB=B7=D6=CE=AA=20
M(wide)*N(1=20
=
<=3DM,N<=3D50)=B8=F6=D0=A1=D5=FD=B7=BD=D0=CE=A1=A3<BR>=C3=BF=B8=F6=D5=
=E2=D1=F9=B5=C4=D0=A1=D5=FD=B7=BD=D0=CE=D3=D00=B5=BD4=C3=E6=C7=BD=A1=A3<B=
R>=B3=C7=B1=A4=D4=DA=CB=FC=B5=C4=CD=E2=B2=BF=B1=DF=D4=B5=D7=DC=CA=C7=D3=D0=
=C7=BD=B1=DA=B5=C4=A3=AC=BA=C3=D5=DA=B5=B2=B7=E7=D3=EA=A1=A3<BR><BR>=BF=BC=
=C2=C7=D5=E2=D7=A2=BD=E2=C1=CB=D2=BB=B8=F6=B3=C7=B1=A4=B5=C4=C6=BD=C3=E6=CD=
=BC=A3=BA<BR> =20
1 2 3 4 5 6 7<BR>#############################<BR>1 # | # | # | |=20
#<BR>#####---#####---#---#####---# <BR>2 # # | # # # #=20
#<BR>#---#####---#####---#####---#<BR>3 # | | # # # # #=20
<BR>#---#########---#####---#---#<BR>4 # -># | | | | # #=20
<BR>############################# <BR><BR># =3D=C7=BD=B1=DA -, | =
=3D =C3=BB=D3=D0=C7=BD=B1=DA<BR>->=20
=
=3D=D2=C6=B3=FD=D5=E2=C3=E6=C7=BD=C4=DC=CA=B9=B5=C3=B5=BD=B5=C4=D0=C2=B7=BF=
=BC=E4=D7=EE=B4=F3<BR><BR><BR>=C0=FD=D7=D3=B5=C4=B3=C7=B1=A4=B5=C4=B4=F3=D0=
=A1=CA=C77 x 4=A1=A3<BR><BR>=D2=BB=B8=F6=20
=
"=B7=BF=BC=E4"=CA=C7=C6=BD=C3=E6=CD=BC=C9=CF=D3=D0=C1=AC=BD=D3=B5=C4"=D0=A1=
=D5=FD=B7=BD=D0=CE"=B5=C4=BC=AF=BA=CF=A1=A3<BR>=D5=E2=B8=F6=C6=BD=C3=E6=CD=
=BC=B0=FC=BA=AC=CE=E5=B8=F6=B7=BF=BC=E4=A1=A3(=CB=FC=C3=C7=B5=C4=B4=F3=D0=
=A1=CA=C79,7,3,1, =BA=CD 8=20
=
=C5=C5=C1=D0=C3=BB=D3=D0=CC=D8=B1=F0=B5=C4=CB=B3=D0=F2)=A1=A3<BR><BR>=D2=C6=
=B3=FD=B1=BB=BC=FD=D7=F7=BC=C7=BA=C5=B5=C4=C7=BD=B1=DA=C0=B4=BA=CF=B2=A2=C1=
=BD=B8=F6=B7=BF=BC=E4=C0=B4=D6=C6=D4=EC=D7=EE=B4=F3=B5=C4=BF=C9=C4=DC=B7=BF=
=BC=E4(=D2=C6=B3=FD=D2=BB=C3=E6=C7=BD=CB=F9=C4=DC=B2=FA=C9=FA=B5=C4)=A1=A3=
<BR>=B3=C7=B1=A4=D7=DC=CA=C7=D6=C1=C9=D9=D3=D0=B6=FE=B8=F6=B7=BF=BC=E4=B2=
=A2=C7=D2=D7=DC=CA=C7=D3=D0=D2=BB=C3=E6=C7=BD=B1=DA=D2=D4=BF=C9=C4=DC=B1=BB=
=D2=C6=B3=FD=A1=A3<BR><BR>PROGRAM=20
NAME: castle<BR><BR>INPUT=20
=
FORMAT<BR><BR>=B5=D8=CD=BC=D2=D4=D2=BB=B8=F6=B1=ED=B8=F1=C0=B4=B4=A2=B4=E6=
=A3=AC=C3=BF=B8=F6=CA=FD=D7=D6=C3=E8=CA=F6=D2=BB=B8=F6=D0=A1=D5=FD=B7=BD=D0=
=CE=A3=ACN=D0=D0=C3=BF=D0=D0M=B8=F6=CA=FD=C0=B4=C3=E8=CA=F6=D5=E2=B8=F6=C6=
=BD=C3=E6=CD=BC=A1=A3<BR>=CA=E4=C8=EB=CB=B3=D0=F2=B7=FB=BA=CF=C4=C7=B8=F6=
=D4=DA=C9=CF=C3=E6=C0=FD=D7=D3=B5=C4=B1=E0=BA=C5=B7=BD=CA=BD=A1=A3<BR>=C3=
=BF=B8=F6=C3=E8=CA=F6=D0=A1=D5=FD=B7=BD=D0=CE=B5=C4=CA=FD=D7=D6=CB=B5=C3=F7=
=D0=A1=D5=FD=B7=BD=D0=CE=B5=C4=CB=C4=C3=E6=B5=C4=C7=BD=B5=C4=B7=D6=B2=BC=C7=
=E9=BF=F6=A3=AC=CB=FC=CA=C7=CF=C2=C3=E64=B8=F6=CA=FD=B5=C4=BA=CD=A3=BA<BR=
><BR>1:=20
=D4=DA=CE=F7=C3=E6=D3=D0=C7=BD <BR>2: =
=D4=DA=B1=B1=C3=E6=D3=D0=C7=BD <BR>4: =D4=DA=B6=AB=C3=E6=D3=D0=C7=BD =
<BR>8: =D4=DA=C4=CF=C3=E6=D3=D0=C7=BD=20
=
<BR><BR>=C4=DA=B2=BF=B5=C4=C7=BD=B1=DA=CA=C7=BB=E1=B1=BB=B6=A8=D2=E5=C1=BD=
=B4=CE=A3=BB=D0=A1=D5=FD=B7=BD=D0=CE(1,1)=C4=CF=C3=E6=B5=C4=C7=BD=D2=B2=B1=
=BB=D6=B8=B3=F6=CA=C7=D0=A1=D5=FD=B7=BD=D0=CE(2,1)=B1=B1=C3=E6=B5=C4=C7=BD=
=A1=A3<BR><BR>=B5=DA 1 =D0=D0:=20
=B6=FE=B8=F6=B1=BB=BF=D5=B8=F1=B7=D6=BF=AA=B5=C4=D5=FB=CA=FD: M =
=BA=CD N <BR>=B5=DA 2 =B5=BD N+1 =D0=D0: M x N =
=B8=F6=D5=FB=CA=FD,=C3=BF=D0=D0M=B8=F6=A1=A3=20
<BR><BR>SAMPLE INPUT (file castle.in) <BR>7 4<BR>11 6 11 6 3 10 =
6<BR>7 9 6=20
13 5 15 5<BR>1 10 12 7 13 7 5<BR>13 11 10 8 10 12 13<BR><BR>OUTPUT =
=
FORMAT<BR>=CA=E4=B3=F6=B0=FC=BA=AC=D2=BB=D0=A9=D0=D0:<BR><BR>=B5=DA 1 =
=D0=D0: =B3=C7=B1=A4=B5=C4=B7=BF=BC=E4=CA=FD=C4=BF=A1=A3 =
<BR>=B5=DA 2=20
=D0=D0: =
=D7=EE=B4=F3=B5=C4=B7=BF=BC=E4=B5=C4=B4=F3=D0=A1 <BR>=B5=DA 3 =
=D0=D0: =20
=
=D2=C6=B3=FD=D2=BB=C3=E6=C7=BD=C4=DC=B5=C3=B5=BD=B5=C4=D7=EE=B4=F3=B5=C4=B7=
=BF=BC=E4=B5=C4=B4=F3=D0=A1 <BR>=B5=DA 4 =D0=D0: =
=D2=C6=B3=FD=C4=C4=C3=E6=C7=BD=20
=
<BR><BR>=D1=A1=D4=F1=D7=EE=BC=D1=B5=C4=C7=BD=C0=B4=D2=C6=B3=FD=A3=AC=D1=A1=
=D4=F1=D7=EE=BF=BF=CE=F7=B5=C4=A3=AC=C8=E7=B9=FB=C8=D4=C8=BB=B2=BB=C4=DC=C8=
=B7=B6=A8=A3=AC=D4=D9=D1=A1=D4=F1=D7=EE=BF=BF=C4=CF=B5=C4=A1=A3=B1=E0=D5=DF=
=D7=A2=A3=BA=C7=BD=B5=C4=CE=BB=D6=C3=D3=A6=B8=C3=D3=C9=CB=FC=B5=C4=D6=D0=B5=
=E3=C0=B4=B6=A8=D2=E5=A1=A3<BR>=C7=BD=B1=DA=D3=C9=CB=FC=D4=DA=CF=E0=C1=DA=
=B5=C4=D0=A1=D5=FD=B7=BD=D0=CE=B5=C4=CE=F7=B2=BF=BB=F2=C4=CF=B7=BD=C0=B4=C3=
=FC=C3=FB<BR><BR>SAMPLE=20
OUTPUT (file castle.out)<BR>5<BR>9<BR>16<BR>4 1 E</DIV>
<HR>
<P><STRONG>USACO 2.1.1 The =
Castle<BR>=CC=E1=BD=BB=B4=CE=CA=FD=A3=BA1=B4=CE</STRONG></P>
=
<P><STRONG>=D5=E2=B5=C0=CC=E2=CE=D2=D2=BB=BF=AA=CA=BC=CF=EB=B2=ED=C1=CB=A3=
=AC=CE=D2=B0=B4=D2=BB=B0=E3=B5=C4=CD=BC=CC=E2=D7=F6=A3=AC=BD=AB=C3=BF=B8=F6=
=B7=BF=BC=E4=B5=B1=B3=C9=D2=BB=B8=F6=BD=E1=B5=E3=A3=AC=B6=C1=C8=EB=C1=BD=B8=
=F6=B7=BF=BC=E4=CA=C7=B7=F1=C1=AA=CD=A8=A3=AC=D3=C3=C1=DA=BD=D3=BE=D8=D5=F3=
=B1=ED=CA=BE=B9=E2=CA=C7=BD=E1=B5=E3=B5=C4=C3=FC=C3=FB=BA=CD=B2=D9=D7=F7=BE=
=CD=B9=BB=C2=E9=B7=B3=C1=CB=A3=AC=BB=B9=D2=AA=C7=F3=D5=E2=C3=B4=B6=E0=B6=AB=
=CE=F7=A3=AC=D0=B4=C1=CB160+=D0=D0=A3=AC=D0=B4=B4=FA=C2=EB=B9=FD=B3=CC=D6=
=D0=D2=F2=CE=AA=B3=CC=D0=F2=CC=AB=C2=D2=BC=B8=BE=AD=B1=C0=C0=A3=A1=A3=BA=F3=
=C0=B4=CD=BB=C8=BB=BF=AA=C7=CF=A3=AC=C6=E4=CA=B5=D5=E2=CC=E2=D3=C9=D3=DA=C3=
=BF=B8=F6=B5=E3=B5=C4=B1=DF=B2=BB=B6=E0=D3=DA4=CC=F5=A3=AC=CB=F9=D2=D4=D3=
=C3=C1=DA=BD=D3=B1=ED=BE=CD=BF=C9=D2=D4=C1=CB=A3=AC=D4=D9=BD=F8=D2=BB=B2=BD=
=CF=EB=B5=BD=A3=AC=BC=C7=C2=BC=CB=FC4=B8=F6=B7=BD=CF=F2=CA=C7=B7=F1=D3=D0=
=C2=B7=BF=C9=D2=D4=C1=CB=A3=AC=D5=E2=D1=F9=BC=F2=B1=E3=C1=CB=BA=DC=B6=E0=A3=
=AC80=D0=D0ac=A1=A3</STRONG></P>
<P><STRONG>=BD=E8=D3=C3usaco=B5=C4=B7=D6=CE=F6=A3=BA</STRONG></P>
<P><STRONG><FONT =
color=3D#ff0000>=CE=D2=C3=C7=D3=C3=D2=BB=B8=F6=C6=D3=CB=D8=B5=C4=B5=DD=B9=
=E9floodfill=20
=
=C0=B4=CC=EE=B3=E4=C3=BF=D2=BB=B8=F6=B3=C7=B1=A4=C0=EF=B5=C4=B7=BF=BC=E4=A3=
=AC=C8=BB=BA=F3=B2=E9=BF=B4=C3=BF=B6=D4=CE=D2=C3=C7=BF=C9=D2=D4=CD=A8=B9=FD=
=C7=C3=CB=E9=C7=BD=B1=DA=B6=F8=C1=AA=CD=A8=B5=C4<STRONG>=B7=BF=BC=E4=A3=AC=
=D3=C9=D3=DA=CE=D2=C3=C7=BD=AB=D2=AA=D3=C3=D7=EE=CE=F7=B5=C4=BA=CD=D7=EE=C4=
=CF=B5=C4=B7=BD=B8=F1=A3=AC=CB=F9=D2=D4=CE=D2=C3=C7=D6=BB=D0=E8=D2=AA=BF=BC=
=C2=C7=C7=C3=CB=E9=B1=B3=C3=E6=B5=C4=C7=BD=BA=CD=B6=AB=C3=E6=B5=C4=A1=A3<=
/STRONG></FONT></STRONG></P>
<P><STRONG>{<BR>TASK:castle<BR>LANG:PASCAL<BR>}<BR>program=20
castle;<BR>const<BR> shl2:array[1..4]of=20
integer=3D(1,2,4,8);<BR> index:array[2..3,1..2] =
of=20
integer=3D((-1,0),(0,1));<BR>var<BR> =20
map:array[1..50,1..50,1..4] of boolean;<BR> =20
fill:array[1..50,1..50] of integer;<BR> =20
area:array[1..2500] of integer;<BR> =20
n,m:integer;<BR>procedure init;<BR>var<BR> =20
i,j,k,x:integer;<BR>begin<BR> =20
assign(input,'castle.in');reset(input);<BR> =20
readln(m,n);<BR> =20
fillchar(map,sizeof(map),true);<BR> for i:=3D1 =
to n=20
do<BR> =20
=
begin<BR> &nbs=
p;=20
for j:=3D1 to m=20
=
do<BR> &=
nbsp; =20
=
begin<BR> &nbs=
p; =20
=
read(x);<BR> &=
nbsp; =20
for k:=3D1 to 4=20
=
do<BR> &=
nbsp; =20
if x and shl2[k]<>0=20
=
then<BR>  =
; =
=20
=
map[i,j,k]:=3Dfalse;<BR> &=
nbsp; =20
=
end;<BR>  =
;=20
readln;<BR> =20
end;<BR> =20
fillchar(fill,sizeof(fill),0);<BR> =20
fillchar(area,sizeof(area),0);<BR> =20
close(input);<BR>end;<BR>procedure=20
floodfill(x,y,c:integer);<BR>begin<BR> if =
fill[x,y]=3D0=20
then<BR> =20
=
begin<BR> &nbs=
p;=20
=
fill[x,y]:=3Dc;<BR> =
=20
=
inc(area[c]);<BR> &n=
bsp; =20
if map[x,y,1] then=20
=
floodfill(x,y-1,c);<BR> &n=
bsp; =20
if map[x,y,2] then=20
=
floodfill(x-1,y,c);<BR> &n=
bsp; =20
if map[x,y,3] then=20
=
floodfill(x,y+1,c);<BR> &n=
bsp; =20
if map[x,y,4] then=20
floodfill(x+1,y,c);<BR> =20
end;<BR>end;<BR>procedure work;<BR>var<BR> =20
i,j,colour,maxarea,k,x,y,w:integer;<BR>begin<BR> =
assign(output,'castle.out');rewrite(output);<BR> =
colour:=3D0;<BR> =
maxarea:=3D0;<BR> for=20
i:=3D1 to n do<BR> for =
j:=3D1 to m=20
=
do<BR> =
if fill[i,j]=3D0=20
=
then<BR>  =
; =20
=
begin<BR> &nbs=
p; =20
=
inc(colour);<BR> &nb=
sp; =20
=
floodfill(i,j,colour);<BR>  =
; =20
if area[colour]>maxarea=20
=
then<BR>  =
; =
=20
=
maxarea:=3Darea[colour];<BR> &nb=
sp; =20
end;<BR> writeln(colour);<BR> =20
writeln(maxarea);<BR> =
maxarea:=3D0;<BR> =20
for j:=3D1 to m do<BR> =
for i:=3Dn=20
downto 1=20
=
do<BR> =
for k:=3D2 to 3=20
=
do<BR> &=
nbsp; =20
if not map[i,j,k]=20
=
then<BR>  =
; =20
=
begin<BR> &nbs=
p;  =
;=20
if=20
=
(i+index[k,1]>0)and(j+index[k,2]<=3Dm)and(fill[i,j]<>fill[i+i=
ndex[k,1],j+index[k,2]])and=20
(area[fill[i,j]]+area[fill[i+index[k,1],j+index[k,2]]]>maxarea) =
=
then<BR>  =
; =
=20
=
begin<BR> &nbs=
p;  =
; =20
=
maxarea:=3Darea[fill[i,j]]+area[fill[i+index[k,1],j+index[k,2]]];<BR>&nbs=
p;  =
; =
=20
=
x:=3Di;<BR> &n=
bsp; &nb=
sp; =20
=
y:=3Dj;<BR> &n=
bsp; &nb=
sp; =20
=
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -