Cod sursa(job #1192333)

Utilizator mpaulMotora Paul mpaul Data 28 mai 2014 21:23:19
Problema Subsecventa de suma maxima Scor 40
Compilator fpc Status done
Runda Arhiva educationala Marime 0.77 kb
program ssm;
var h,g:text;
best,a,pi:array[1..6000000] of integer;
bestsum,i,n,ext,ps:longint;

begin
   assign(h,'ssm.in');
   reset(h);
   assign(g,'ssm.out');
   rewrite(g);
   readln(h,n);
   for i:=1 to n do
      begin
        read(h,a[i]);
      end;
   bestsum:=a[1];
   pi[1]:=1;
   ps:=1;
   for i:=2 to n do
      begin
         best[i]:=a[i];
         if best[i]<(best[i-1]+a[i]) then
            begin
            pi[i]:=pi[i-1];
            best[i]:=best[i-1]+a[i];
            end
            else
            pi[i]:=i;
         if bestsum<best[i] then
            begin
            bestsum:=best[i];
            ps:=i;
            ext:=pi[i];
            end;
      end;
   writeln(g,bestsum,' ',ext,' ',ps);


close(h);
close(g);

end.