Cod sursa(job #743269)

Utilizator RadioactivMihai Preguza Radioactiv Data 3 mai 2012 20:47:56
Problema Subsecventa de suma maxima Scor 35
Compilator fpc Status done
Runda Arhiva educationala Marime 0.63 kb
Program blabla;
var t,s:array[1..6000000] of longint;
    n,i1,j1,i,j,r:longint;

BEGIN
  assign(input,'ssm.in');
  reset(input);
  readln(n);
  read(r);
  s[1]:=r;
  t[1]:=r;
  for i:=2 to n do
    begin
      read(t[i]);
      s[i]:=s[i-1]+t[i];
    end;
  close(input);
//  s[1]:=t[1];
//  for i:=2 to n do
//    s[i]:=s[i-1]+t[i];
  r:=s[1];
  i1:=1;
  j1:=1;
  for i:=1 to n do
    for j:=i to n do
      if s[j]-s[i]>r then
        begin
          r:=s[j]-s[i];
          i1:=i;
          j1:=j;
        end;
  assign(output,'ssm.out');
  rewrite(output);
  write(r,' ',i1+1,' ',j1);

  close(output);
END.