Cod sursa(job #542123)
| Utilizator | Data | 25 februarie 2011 20:13:20 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 70 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
program lsdkjf;
var a,i,n,x,y,sum,max,u,p:longint;
f,g:text;
begin
assign(f,'ssm.in');
assign(g,'ssm.out');
rewrite(g);
reset(f);
readln(f,n);
max:=-maxint;
p:=1;
u:=1;
x:=1;
y:=1;
for i:=1 to n do
begin
read(f,a);
if (sum+a>a) then
begin
sum:=sum+a;
u:=i;
end
else
begin
sum:=a;
p:=i;
u:=i;
end;
if (sum>max) then
begin
max:=sum;
x:=p;
y:=u;
end;
end;
writeln(g,max,' ',x,' ',y);
close(g);
close(f);
end.
