205412026-01-07 17:42:28algoproLeggyorsabb pénzkeresés (50)pypy3Time limit exceeded 18/50303ms31988 KiB
# UUID: ec33b1d1-1cb8-414e-aaf9-6aa58539269d
n, m = [int(x) for x in input().split()]
lista = [int(x) for x in input().split()]
#lista.sort()
mini = n
bal = 0
jobb = 0

while jobb < n:
    penz = sum(lista[bal:jobb+1])
    if m > penz:
        jobb+=1
    else:
        mini = min(mini,jobb-bal+1)
        bal+=1
print(mini)
SubtaskSumTestVerdictTimeMemory
base18/50
1Accepted0/045ms19492 KiB
2Time limit exceeded0/0294ms31980 KiB
3Accepted2/250ms21536 KiB
4Accepted2/246ms21496 KiB
5Accepted2/252ms21344 KiB
6Accepted2/279ms22304 KiB
7Accepted2/2123ms22220 KiB
8Accepted2/2157ms22504 KiB
9Accepted2/278ms22212 KiB
10Accepted2/2131ms22796 KiB
11Accepted2/2107ms31980 KiB
12Time limit exceeded0/2280ms31796 KiB
13Time limit exceeded0/2303ms31788 KiB
14Time limit exceeded0/2266ms31980 KiB
15Time limit exceeded0/2303ms31788 KiB
16Time limit exceeded0/2238ms31980 KiB
17Time limit exceeded0/2240ms31980 KiB
18Time limit exceeded0/2303ms31980 KiB
19Time limit exceeded0/2284ms31980 KiB
20Time limit exceeded0/2282ms31980 KiB
21Time limit exceeded0/2303ms31980 KiB
22Time limit exceeded0/2284ms31980 KiB
23Time limit exceeded0/2291ms31788 KiB
24Time limit exceeded0/2287ms31976 KiB
25Time limit exceeded0/2289ms31980 KiB
26Time limit exceeded0/2284ms31980 KiB
27Time limit exceeded0/2286ms31988 KiB