백준 1449 [수리공 항승] 파이썬

https://www.acmicpc.net/problem/1449

1449번: 수리공 항승

#백준 1449

N,L=map(int,input().split())
lst=list(map(int,input().split()))
lst.sort()
s=[]
for i in range(len(lst)-1):
    s.append(lst[i+1]-lst[i])

ans=0
d=0
i=0
while i<(N-1):
    if d+s[i]>(L-1):
        ans+=1
        i+=1
        d=0
    else:
        d+=s[i]
        i+=1

print(ans+1)

 

#백준 1449 다른 풀이

n, l = map(int, input().split())
s = list(map(int, input().split()))
s.sort()
start = s[0]
end = s[0] + l
cnt = 1
for i in range(n):
    if start <= s[i] < end:
        continue
    else:
        start = s[i]
        end = s[i] + l
        cnt += 1
print(cnt)