Cod sursa(job #411368)
| Utilizator | Data | 4 martie 2010 20:58:41 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 70 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
const infile='ssm.in';
outfile='ssm.out';
var n,s,i,ic,sf,k:longint;
best,suma:longint;
begin
assign(input,infile); reset(input); readln(n);
read(suma); k:=1;
best:=-maxlongint;
for i:=2 to n do begin
read(s);
if(suma+s>s)then inc(suma,s)
else begin suma:=s; k:=i; end;
if(best<suma)then begin best:=suma; ic:=k; sf:=i; end;
end;
close(input);
assign(output,outfile); rewrite(output);
write(best,' ',ic,' ',sf);
close(output);
end.
