Skip to content

[Algorithm] 최솟값 구하기 #238

Description

@hwangJi-dev

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

importsysinput=sys.stdin.readlinefromcollectionsimportdequeN, L=list(map(int, input().split()))
A=list(map(int, input().split()))
queue=deque()
foriinrange(N):
whilequeueandqueue[-1][0] >A[i]:
queue.pop()
queue.append((A[i], i))
ifqueue[0][1] <=i-L:
queue.popleft()
print(queue[0][0], end=' ')

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

Labels

Projects

No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions