Cod sursa(job #1182756)
Utilizator | Data | 7 mai 2014 15:49:44 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 25 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 1.34 kb |
Program ssm;
var n,i,suma,pivot,aux,max,sol,k : longint;
A,lsol : array[1..10000] of longint;
begin
assign(input,'ssm.in'); reset(input);
assign(output,'ssm.out'); rewrite(output);
readln(n);
pivot:=1;
for i:=1 to n do read(A[i]);
pivot:=1;
for i:=1 to n do begin
suma:=A[i];
pivot:=i+1;
while pivot<=n do begin
suma:=suma+A[pivot];
if suma>max then begin
max:=suma;
sol:=0;
for k:=pivot downto i do begin
sol:=sol+1;
lsol[sol]:=k;
end;
end;
pivot:=pivot+1;
end;
end;
writeln(max,' ',lsol[sol],' ',lsol[1]);
close(input);
close(output);
end.