192782025-12-03 16:51:45birozsFolyóparti telkek (40 pont)python3Time limit exceeded 20/40201ms15188 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/016ms3052 KiB
2Time limit exceeded0/0180ms15188 KiB
3Runtime error0/216ms3092 KiB
4Accepted2/216ms2992 KiB
5Accepted2/217ms3180 KiB
6Accepted2/216ms3124 KiB
7Accepted2/217ms3136 KiB
8Accepted3/335ms3300 KiB
9Accepted3/326ms3380 KiB
10Accepted3/332ms3384 KiB
11Accepted3/327ms3480 KiB
12Time limit exceeded0/3201ms8508 KiB
13Time limit exceeded0/3201ms9796 KiB
14Time limit exceeded0/3187ms8556 KiB
15Time limit exceeded0/3200ms11916 KiB
16Time limit exceeded0/3184ms12696 KiB
17Time limit exceeded0/3184ms13156 KiB