192792025-12-03 16:52:27birozsFolyóparti telkek (40 pont)pypy3Runtime error 20/40203ms32000 KiB
N,P = map(int,input().split())
telek = list(map(int,input().split()))
i = 0
while telek[i] > P and i<N:
    i += 1
if i==N:
    print(0)
else:
    j = i
    maxtelek = 0
    while i < N:
        resz = sum(telek[j:i+1])
        if i+1-j > maxtelek:
            maxtelek = i+1-j
        if i < N-1:
            if resz + telek[i+1] <= P:
                i = i + 1
            elif telek[i+1] > P:
                i = i + 1
                j = i + 1
            elif resz + telek[i+1] > P:
                while resz + telek[i+1] > P and j<=i:
                    j += 1
                    resz = sum(telek[j:i+1])
                i += 1
            else:
                i += 1
        else:
            i += 1
print(maxtelek)
SubtaskSumTestVerdictTimeMemory
base20/40
1Accepted0/043ms19596 KiB
2Runtime error0/068ms32000 KiB
3Runtime error0/268ms22668 KiB
4Accepted2/243ms19376 KiB
5Accepted2/245ms19432 KiB
6Accepted2/248ms21456 KiB
7Accepted2/254ms21436 KiB
8Accepted3/361ms21716 KiB
9Accepted3/379ms21988 KiB
10Accepted3/371ms21988 KiB
11Accepted3/368ms22256 KiB
12Time limit exceeded0/3203ms27024 KiB
13Time limit exceeded0/3158ms28456 KiB
14Time limit exceeded0/3187ms28976 KiB
15Time limit exceeded0/3202ms31596 KiB
16Time limit exceeded0/3187ms31604 KiB
17Time limit exceeded0/3194ms31860 KiB