Cod sursa(job #1135939)

Utilizator DjokValeriu Motroi Djok Data 8 martie 2014 16:31:26
Problema Subsecventa de suma maxima Scor 100
Compilator fpc Status done
Runda Arhiva educationala Marime 0.74 kb
var a:array[0..6000001] of int64;
    i,k,head,tail,rs,min,n:longint;
    buf1:array[1..1 shl 16] of char;

begin
assign(input,'ssm.in');
assign(output,'ssm.out');
reset(input);
rewrite(output);
settextbuf(input,buf1);
  readln(n);

       rs:=-2000000000;
   for i:=1 to n do
    begin
     read(a[i]);
     inc(a[i],a[i-1]);
     if rs<a[i]-min then begin
                          rs:=a[i]-min;
                          head:=k+1;
                          tail:=i;
                         end;
     if min>a[i] then begin
                       min:=a[i];
                       k:=i;
                      end;
    end;

    writeln(rs,' ',head,' ',tail);

close(input);
close(output);
{Totusi este trist in lume}
end.