🔒 Help TLE

[fast pond]

Pls help to optimize it

from itertools import product

n, s, t = map(int, input().split())
robots = list(map(int, input().split()))

max_sum = 0

for combo in product(['l', 'r'], repeat=t):
    current_sum = 0
    remaining_robots = robots.copy()
    for direction in combo:
        if direction == 'l':
            current_sum += sum(remaining_robots[:s])
            remaining_robots = remaining_robots[s:]
        else:
            current_sum += sum(remaining_robots[-s:])
            remaining_robots = remaining_robots[:-s]
    max_sum = max(max_sum, current_sum)

print(max_sum)

[edgy turtle]

@fast pond

Python help channel opened

Remember to:

• Ask your Python question, not if you can ask or if there's an expert who can help.
• Show a code sample as text (rather than a screenshot) and the error message, if you've got one.
• Explain what you expect to happen and what actually happens.

:warning: Do not pip install anything that isn't related to your question, especially if asked to over DMs.

Closes after a period of inactivity, or when you send !close.

[light dirge]

what does it do?

[edgy turtle]

Python help channel closed

This help channel has been closed and it's no longer possible to send messages here. If your question wasn't answered, feel free to create a new post in #1035199133436354600. To maximize your chances of getting a response, check out this guide on asking good questions.