编程题2

# python跑的也太慢了！！同样的算法，C++能通过，python只能跑完70%就超时了

n = eval(input())
nums = list(map(int,input().split()))



max_ = 0

for i in range(100,0,-1):
    summ = 0
    minimum = i
    for j in range(n):
        if nums[j] < i:
            max_ = max(max_, summ*minimum)
            summ = 0
            minimum = i 
        else:
            summ += nums[j]
            minimum = min(minimum, nums[j])
    
print(max_)

python3测试通过
耗时间的应该是取每个最小值的时候，需要停止条件设置设置得准确些。当我最小值设置为一个固定数值的时候(就是我给出的min_limit初值)，python3通过90%。

import sys


def get_max_prod_ge_n(nums, n):
    res, max_res = 0, 0
    for i in nums:
        if i >= n:
            res += i * n
            max_res = res if res > max_res else max_res
        else:
            res = 0
    return max_res


if __name__ == '__main__':
    len_nums = int(sys.stdin.readline())
    nums = [int(s) for s in sys.stdin.readline().split()]
    max_res = 0

    nums_unique_sorted = sorted(list(set(nums)), reverse=True)
    max_num = nums_unique_sorted[0]
    min_limit = max_num / len_nums

    for i in [i for i in nums_unique_sorted if i >= min_limit]:
        res_i = get_max_prod_ge_n(nums, i)
        if res_i > max_res:
            max_res = res_i
            new_limit = res_i / (max_num * len_nums)
            min_limit = new_limit if new_limit > min_limit else min_limit
        max_res = res_i if res_i > max_res else max_res
    print(max_res)

球球大佬帮我看看为什么提示有语法错误或者数组越界泥 

n = int(input())
l = list(map(int,input().split(' ')))
str = [] for i in range(0,n):  for j in range(i+1,n+1):
       str.append(l[i:j]) 
k = 0 maxdata = 0 while k< len(str):
    sum = 0  mul = 1    for j in str[k]:
        sum += j
    mul = sum * min(str[k]) print(mul)
    maxdata = max(mul,maxdata)
    k += 1 print(maxdata)

用了以下三种方法，通过率分别为20%， 50%， 60%，看来python还是太慢了。。。
n = int(input())
inp = list(map(int, input().split()))
max_num = 0
'''
## brute force method O(n^3)
for i in range(1,n+1):
    for j in range(0,n-i+1):
        temp = min(inp[j:j+i]) * sum(inp[j:j+i])
        if temp > max_num:
            max_num = temp
'''

'''
## O(n^2)
for i in range(n):
    left_index = i
    right_index = i
    while left_index > 0:
        if inp[left_index -1] < inp[i]:
            break
        else :
            left_index -= 1
    while right_index < n-1:
        if inp[right_index +1] < inp[i]:
            break
        else :
            right_index += 1
    temp = min(inp[left_index:right_index+1]) * sum(inp[left_index:right_index+1])
    if temp > max_num:
        max_num = temp
'''
# O(n)
for i in range(0,101):
    min_num = 101
    sum1 = 0
    for j in range(n):
        if inp[j] < i :
            max_num = max(max_num, sum1 * min_num)
            sum1 = 0
            min_num = 101
        else :
            sum1 += inp[j]
            min_num = min(min_num, inp[j])
            
print(max_num)