Apr-10-2022, 08:16 AM
(This post was last modified: Apr-10-2022, 08:19 AM by Gribouillis.)
Here is a much shorter attempt
def solve(L, K): n, s, p = len(L), 0, -1 for i, x in enumerate(L): if x > K: s += (i - p) * (n - i) p = i return s inp = """\ 2 3 2 1 2 3 3 1 1 2 3 """ def main(): import io f = io.StringIO(inp) ntcase = int(next(f).strip()) for i in range(ntcase): N, K = (int(x) for x in next(f).strip().split()) L = [int(x) for x in next(f).strip().split()] assert(len(L) == N) print(solve(L, K)) if __name__ == '__main__': main()