Question

pascal长蛇阵问题： 急急急急急急急急急急急！

Answer 1

额。。我用了最笨的方法，类似穷举很好懂，只测试了样例，所有数据类型定义的是整型

不能保证数据大了全过，没时间写了
program changshe;
var map:array[1..10000,1..10000] of boolean;
sum:array[1..10000] of integer;
js,i,j,k,m,n,a,x,y,max:integer;
begin
read(n,m);
for i:=1 to n do
begin
for j:=1 to m do
begin
read(a);
if a=0 then map[i,j]:=false else map[i,j]:=true;
end;
readln;
end;
for i:=1 to n do
for j:=1 to m do
if map[i,j]=true then
begin
inc(js);
k:=i;
while(map[k,j]=true) do
begin
sum[js]:=sum[js]+1;
inc(k);
end;
inc(js);
k:=j;
while (map[i,k]=true) do
begin
inc(sum[js]);
inc(k);
end;
inc(js);
x:=i;y:=j;
while (map[x,y]=true) do
begin
inc(sum[js]);
inc(x);inc(y);
end;
end;
max:=0;
for i:=1 to js do
if sum[i]>max then
max:=sum[i];
write(max);
end.