Cod sursa(job #1198541)

Utilizator SwampiPasca Marius Swampi Data 16 iunie 2014 09:19:45
Problema Subsecventa de suma maxima Scor 0
Compilator fpc Status done
Runda Arhiva educationala Marime 0.62 kb
type vector=array[0..1000] of longint;
var v,s:vector;
    a,b,i,j,sum,n,max,o:longint;
begin
write('n=');readln(n);
sum:=0;
for i:=1 to n do
    begin
    write('v[',i,']=');
    readln(v[i]);
    sum:=sum+v[i];
    s[i]:=sum;
    end;
s[0]:=0;
i:=0;
max:=-maxint;
while i<n do
    begin
    j:=n-i;
    o:=1;
    while j<=n do
          begin
          if s[j]-s[o]>max then
             begin
             max:=s[j]-s[o];
             a:=o+1;
             b:=j;
             end;
          inc(o);
          inc(j);
          end;
    inc(i);
    end;
for i:=a to b do
    write(v[i],' ');
end.