За один проход в массиве найдите непрерывный кусок, сумма чисел в котором максимальна

n = int(input())
a = []
for i in range(n):
    a.append(int(input()))
if n == 2:
    print(1)
    print(2)
    exit(0)
ans = a[0]
ans_l = 0
ans_r = 0
s = 0
minus_pos = -1;
for r in range(n):
    s += a[r];
    if (s > ans):
        ans = s
        ans_l = minus_pos + 1
        ans_r = r
    if (s < 0):
        s = 0
        minus_pos = r
print(ans_l+1)
print(ans_r+1)

# -*- coding: utf-8 -*-
 
 
class Result:
 
    def __init__(self, total, start, end):
        self.total = total
        self.start = start
        self.end = end
 
    def __lt__(self, other):
        if self.total == other.total:
            if self.end == other.end:
                return self.start > other.start
            else:
                return self.end < other.end
        else:
            return self.total > other.total
 
 
n = 8
a = [7, 2, -2, 3, -1, 5, -2, 7]
_a = []
 
for i in range(n):
    for j in range(i, n):
        _a.append(Result(sum(a[i: j]), i, j))
 
_a.sort()
 
for obj in _a:
    print(obj.total, obj.start, obj.end)

n = int(input())
a = []
for i in range(n):
    a.append(int(input()))
if n == 2:
    print(1)
    print(2)
    exit(0)
ans = a[0]
ans_l = 0
ans_r = 0
s = 0
minus_pos = -1;
for r in range(n):
    s += a[r];
    if (s > ans):
        ans = s
        ans_l = minus_pos + 1
        ans_r = r
    if (s <= 0): #Вот здесь!
        s = 0
        minus_pos = r
print(ans_l+1)
print(ans_r+1)

class Segment:
    def __init__(self, arr, leftI, rightI):
        self.arr = arr
        self.leftI = leftI
        self.rightI = rightI
    def sumS(self):
        s = sum(self.arr[self.leftI:self.rightI+1])
        return s
    def __lt__(self, other):
        if self.sumS() == other.sumS():
            if self.rightI == other.rightI:
                return self.leftI < other.leftI
            else:
                return self.rightI > other.rightI
        else:
            return self.sumS() < other.sumS()
 
if __name__ == '__main__':
    n = 8
    a = [7, 2, -2, 3, -1, 5, -2, 7]
    _a = []
    for i in range(n):
        for j in range(i, n):
            _a.append(Segment(a, i, j))
    _a.sort()
    result = _a[-1]
    print(result.leftI, result.rightI, result.sumS())
    #print('*'*10)
    #for obj in _a:
    #    print(obj.leftI, obj.rightI, obj.sumS())

_a.append(Result(sum(a[i:j+1]), i, j))

n = int(input())
if n == 2:
    print(1)
    print(2)
    exit(0)
p = [0] * (n + 1)
ibest = 0
jbest = 0
c = 0
imin = 0
for i in range(1, n + 1):
    a = int(input())
    p[i] = p[i - 1] + a
    if p[i] <= 0:
        imin = i
for j in range(1, n + 1):
    if p[j] < p[imin]:
        imin =  j
    if p[j] - p[imin] > p[jbest] - p[ibest]:
        jbest = j
        ibest = imin
for i in range(len(p)):
    if p[i] <= 0:
        c = c+1
if c == len(p):
    ibest = p.index(max(p[1:]))-1
    jbest = p.index(max(p[1:]))
if ibest < jbest:    
    print(ibest+1, jbest)
else:
    print(ibest, jbest)