TONGLT PASCAL

var n,i,j,x,y,l,maxx,x1,y1:longint;
    a,f:array[0..1000000]of longint;
    m:array[0..1000000]of longint;
procedure nhap;
begin
    readln(n);
    for i:=1  to n do read(a[i]);
end;

procedure tinh_f;
begin
    f[0]:=0;
    for i:=1  to n do f[i]:=f[i-1]+a[i];
end;

procedure tinh_min;
begin
    m[0]:=0;
    for i:=1  to n do
    if f[i]<f[m[i-1]] then m[i]:=i
    else m[i]:=m[i-1];
end;

procedure giai;
begin
    maxx:=-1000000;
    for j:=1 to n do
    begin
        if f[j]-f[m[j-1]]>maxx then
        begin
            maxx:=f[j]-f[m[j-1]];
            y:=j;
            x:=m[j-1]+1;
        end;
    end;
    writeln(x,' ',y-x+1);
end;

begin
    assign(input,'TONGLT.inp');reset(input);
    assign(output,'TONGLT.out');rewrite(output);
    nhap;
    tinh_f;
    tinh_min;
    giai;
    close(input);close(output);
end.