202612026-01-05 18:11:42algoproLeggyorsabb pénzkeresés (50)pypy3Wrong answer 46/5082ms31980 KiB
# UUID: 07a0fe94-68a8-4fd8-890c-81dfadfe7586
INPA, INPB = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]

idoszakok = INPA
CLepesek = 0
XPO = 0
YPO = 0
Cosszeg = 0
Run = True
while YPO<INPA:
    if Cosszeg >= INPB:
        idoszakok = min(idoszakok, CLepesek)
        XPO += 1
        #YPO = XPO
        CLepesek -= 1
        Cosszeg -= A[XPO]
    else:
        CLepesek += 1
        YPO += 1
        if YPO < INPA:
            Cosszeg += A[YPO]
        

print(idoszakok)

#3 6 4 2 3 7 2 9
SubtaskSumTestVerdictTimeMemory
base46/50
1Accepted0/043ms19352 KiB
2Accepted0/079ms31976 KiB
3Accepted2/239ms19460 KiB
4Accepted2/239ms19436 KiB
5Wrong answer0/239ms19452 KiB
6Accepted2/257ms21476 KiB
7Accepted2/252ms21736 KiB
8Accepted2/252ms21700 KiB
9Accepted2/257ms21480 KiB
10Accepted2/252ms21736 KiB
11Accepted2/279ms31912 KiB
12Accepted2/271ms31980 KiB
13Accepted2/279ms31976 KiB
14Accepted2/268ms31868 KiB
15Accepted2/281ms31936 KiB
16Accepted2/270ms31912 KiB
17Accepted2/278ms31980 KiB
18Accepted2/268ms31980 KiB
19Accepted2/281ms31956 KiB
20Accepted2/279ms31976 KiB
21Accepted2/268ms31856 KiB
22Accepted2/268ms31980 KiB
23Wrong answer0/282ms31852 KiB
24Accepted2/268ms31864 KiB
25Accepted2/268ms31980 KiB
26Accepted2/278ms31784 KiB
27Accepted2/279ms31980 KiB