Cod sursa(job #367548)

Utilizator juniorOvidiu Rosca junior Data 22 noiembrie 2009 17:32:50
Problema Subsecventa de suma maxima Scor 70
Compilator fpc Status done
Runda Arhiva educationala Marime 0.7 kb
Program perle2;

Var
  f,g: text;
  s,mi: array [1..6000000] Of longint;
  n, i, su, max, j, min, imin, sf : longint;
  k: integer;
begin
  assign(f,'ssm.in'); reset(f);
  assign(g,'ssm.out'); rewrite(g);
  readln(f, n); min := maxlongint;
  for i:=1 to n do
    begin
      read(f, j);
      su := su+j;
      s[i] := su;
      if (min > su) then
        begin
          min := su; imin := i;
        end;
      mi[i] := min;
    end;
  su := 0; max := -maxlongint+1;
  for i:=1 to n do
    begin
      su := s[i]-mi[i-1];
      if (max < su) then
        begin
          max := su; sf := i;
        end;
    end;
  write(g, max, ' ', imin+1, ' ', sf);
  close(f);
  close(g);
end.