巫妖王 2010-09-24 00:05:00
点我顶贴
收藏
删除
var
ans,i,x,k,n,p,s:longint;
a:array[0..1000000]of longint;
begin
readln(n);
for i:=1 to n do read(a[i]);
p:=a[1];
ans:=-maxlongint;
repeat
s:=0;
for i:=1 to n do begin
inc(s,a[i]);
if s>ans then ans:=s;
if s<0 then s:=0;
end;
k:=a[1];for i:=1 to n-1 do a[i]:=a[i+1];a[n]:=k;
until a[1]=p;
write(ans);
end.
最后三个点过不鸟，私人为我的算法比较完美，为什么不AC?，请大牛指点