195312025-12-13 07:22:37birozsTűzijátékpython3Accepted 50/5090ms14912 KiB
N,S,T = map(int,input().split())
Tav = list(map(int,input().split()))
Tav = [0] + Tav[:]
Van = [0] * (N+1)
Van[S] = 1
akt = Tav[S]
for i in range(S,0,-1):
    if akt - Tav[i-1] >= T:
        Van[i-1] = 1
        akt = Tav[i-1]
akt = Tav[S]
for i in range(S,N):
    if Tav[i+1] - akt >= T:
        Van[i+1] = 1
        akt = Tav[i+1]
print(Van.count(1))
for i in range(1,N+1):
    if Van[i] == 1:
        print(i,end=" ")
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/016ms3320 KiB
2Accepted0/090ms14076 KiB
3Accepted2/214ms3312 KiB
4Accepted2/216ms3128 KiB
5Accepted2/214ms3120 KiB
6Accepted2/216ms3124 KiB
7Accepted2/216ms3140 KiB
8Accepted2/216ms3136 KiB
9Accepted2/220ms3860 KiB
10Accepted2/220ms4148 KiB
11Accepted2/224ms4148 KiB
12Accepted2/228ms5292 KiB
13Accepted2/228ms5376 KiB
14Accepted2/227ms5396 KiB
15Accepted3/329ms5296 KiB
16Accepted3/337ms6660 KiB
17Accepted3/343ms8072 KiB
18Accepted3/350ms9180 KiB
19Accepted3/390ms14912 KiB
20Accepted3/387ms14092 KiB
21Accepted4/486ms14688 KiB
22Accepted4/479ms14840 KiB