175 条题解
-
0
mintalfance LV 10 @ 2009-09-07 21:20:25
program p1199;
var a:array[1..100,1..100] of longint;
i,j,k,l,m,n,max:longint;
t:char;
function sum(x,y:longint):longint;
var g,t,s:longint;
begin
s:=0;
for g:=0 to m-1 do
for t:=0 to m-1 do
inc(s,a);
sum:=s;
end;
begin
readln(n);
readln(m);
for i:=1 to n do begin
for j:=1 to n do begin
read(t);
if t='#' then a:=1;end; readln;
end;
for i:=1 to n-m+1 do
for j:=1 to n-m+1 doif sum(i,j)>max then max:=sum(i,j);
writeln(max);
end.o(n^4)秒杀。。。太弱了。。
-
0
var
m,n,i,j,x,y,s,max:longint;
a:array[1..100,1..100]of char;
begin
readln(m);
readln(n);
for i:=1 to m do
begin
for j:=1 to m do
read(a);
readln;
end;
max:=0;
for i:=1 to m-(n-1) do
for j:=1 to m-(n-1) do
begin
s:=0;
for x:=i to i+n-1 do
for y:=j to j+n-1 do
if a[x,y]='#' then inc(s);
if s>max then max:=s;
end;
writeln(max);
end. -
0
lemon_TsyD LV 9 @ 2009-08-22 16:31:54
晕死~费劲编个O(m^2)答案错误。
编个O(m^2*k^2) 0ms 郁闷。。。。。。 -
0
szy_1996725 LV 8 @ 2009-08-21 21:25:42
var t,n,m,i,j,k,l,max:longint;
a:array[0..100,0..100] of char;
begin
readln(n);
readln(m);
for i:=1 to n do
begin
for j:=1 to n do
read(a);
readln;
end;
for i:=1 to n-m+1 do
for j:=1 to n-m+1 do
begin
t:=0;
for k:=i to i+m-1 do
for l:=j to j+m-1 do
if a[k,l]='#' then t:=t+1;
if t>max then max:=t;
end;
writeln(max);
end. -
0
庆祝第20题AC！
program hedanweiji;
var i,j,k,l,m,n,oooo,ToT:longint;
a:array[-1..1000,-1..1000]of char;
begin
assign(input,'hd.txt');
reset(input);
oooo:=0;readln(m);
readln(n);
for i:=1 to m do begin
for j:=1 to m do
read(a); readln;end;
close(input);
for i:=1 to (m-n+1) do
for j:=1 to (m-n+1) do
begin
tot:=0;
for k:=1 to n do
for l:=1 to n do
if a='#' then inc(ToT);
if ToT>oooo then oooo:=ToT;
end;
writeln(oooo);end.
-
0
program dsa;
var i,j,i1,j1,m,n,s,max:integer;
a:array[1..100,1..100] of 0..1;
st:string;
begin
readln(m);
readln(n);
max:=0;
for i:=1 to m do
begin
readln(st);
for j:=1 to m do if st[j]='.' then a:=0
else if st[j]='#' then a:=1;
end;
for i:=1 to m-(n-1) do
for j:=1 to m-(n-1) do
begin
s:=0;
for i1:=i to i+n-1 do
for j1:=j to j+n-1 do s:=s+a[i1,j1];
if s>max then max:=s;
end;
write(max);
end.农夫山泉
此题建议练习打字
-
0
1次AC
var
s:string;
n,m,i,j,k,x,y,sum,max:integer;
a,h:array[0..100,0..100]of integer;
begin
readln(n,m);
fillchar(a,sizeof(a),0);
fillchar(h,sizeof(h),0);
for i:=1 to n do
begin
readln(s);
for j:=1 to n do
if s[j]='#' then a:=1;
end;
for i:=1 to n do
for j:=1 to n do
h:=h+a;
max:=0;
for i:=1 to n-m+1 do
for j:=1 to n-m+1 do
begin
sum:=0;
x:=i+m-1;
y:=j+m-1;
for k:=i to x do
sum:=sum+h[k,y]-h[k,j-1];
if sum>max then max:=sum;
end;
writeln(max);
end.
mintalfance
LV 10
@ 2009-09-07 21:20:25
