We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I have written below code for this problem. It fails with timeout for testcases other than first one. For firtst one it works fine
!/bin/python3
import sys
def solve(A):
# Return the sum of S(S(A)) modulo 10^9+7.
total=sum(A)
for _ in range(len(A)-1):
b=A[:]
for k in range(1,len(A)):
for i in range(len(A)-k):
j=i+k+1
x=max(A[i:j])
b.append(x)
total+=x
A=b[:]
return total
if name == "main":
n = int(input().strip())
A = list(map(int, input().strip().split(' ')))
result = solve(A)
print(result)
Max Transform
You are viewing a single comment's thread. Return to all comments →
I have written below code for this problem. It fails with timeout for testcases other than first one. For firtst one it works fine
!/bin/python3
import sys
def solve(A): # Return the sum of S(S(A)) modulo 10^9+7. total=sum(A) for _ in range(len(A)-1): b=A[:] for k in range(1,len(A)): for i in range(len(A)-k): j=i+k+1 x=max(A[i:j]) b.append(x) total+=x A=b[:] return total if name == "main": n = int(input().strip()) A = list(map(int, input().strip().split(' '))) result = solve(A) print(result)
for complete solution in python java c++ and c programming search for programs.programmingoneonone.com on google