Cod sursa(job #1119824)
Utilizator | Data | 24 februarie 2014 20:16:13 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
program osszeg;
type vektor=array[1..1000] of real;
var v:vektor;
n,i,j,z,y,k:integer;
s,max:real;
f,g:text;
procedure beolvas(var v:vektor; var n:integer);
begin
assign(f,'ssm.in');
reset(f);
readln(f,n);
for i:=1 to n do
read(f,v[i]);
close(f);
end;
begin
beolvas(v,n);
for i:=1 to n do
for j:= i to n do
begin
s:=0;
for k:=i to j do
s:=s+v[k];
if s>max then begin max:=s; z:=i; y:=j; end;
end;
assign(g,'ssm.out');
rewrite(g);
write(g,max:0:0,' ',z,' ',y);
close(g);
end.