Cod sursa(job #1179377)
Utilizator | Data | 28 aprilie 2014 16:27:21 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 70 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
program p1;
var a:array[0..6000000] of longint;
n,i,sum,indb,inde,i1,j1,max:longint;
begin
assign(input,'ssm.in');
reset(input);
assign(output,'ssm.out');
rewrite(output);
readln(n);
indb:=1;
sum:=0;
for i:=1 to n do read(a[i]);
for i:=1 to n do
begin
if sum+a[i]>=0 then
begin
inde:=i;
sum:=sum+a[i];
end
else begin
indb:=i+1;
sum:=0;
end;
if max<sum then begin
max:=sum;
i1:=indb;
j1:=inde;
end
end;
writeln(max,' ',i1,' ',j1);
close(output);
end.