Abstract
An article from the series dedicated to problems of Mathematical Olympiad - category P (programming) shows us one easy theoretical competition problem from the recent school round held in the school year 2020/21. The problem deals with finding the longest possible section in a sequence of positive numbers, in which the sum of all numbers does not exceed a known value.
The article shows various possible solutions and compares their time complexity.