180952025-09-29 15:18:44birozsLeghosszabb nyaralás (75 pont)python3Accepted 75/75134ms13388 KiB
N,P = map(int,input().split())
T = list(map(int,input().split()))
maxhossz = 0
i = 0
j = 0
maxhossz = 0
akt = 0
while j < N :
    if akt + T[j] <= P:
        akt += T[j]
        j += 1
    else:
        if j - i > maxhossz:
            maxhossz = j - i
        if akt > 0:
            akt -= T[i]
        i += 1
        if i > j:
            j = i
if j == N and j - i > maxhossz:
    maxhossz = j - i
print(maxhossz)

SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/014ms3124 KiB
2Accepted0/0128ms13360 KiB
3Accepted3/316ms3124 KiB
4Accepted3/316ms3124 KiB
5Accepted3/316ms3124 KiB
6Accepted3/316ms2872 KiB
7Accepted3/316ms3124 KiB
8Accepted4/416ms3124 KiB
9Accepted4/416ms2976 KiB
10Accepted5/517ms3196 KiB
11Accepted5/526ms3636 KiB
12Accepted5/527ms4056 KiB
13Accepted7/771ms5624 KiB
14Accepted7/7115ms10068 KiB
15Accepted7/7134ms13364 KiB
16Accepted8/8108ms10936 KiB
17Accepted8/8130ms13388 KiB