코딩테스트/백준
2024. 9. 6.
[백준] 11003번 : 최솟값 찾기
🔗 문제 링크https://www.acmicpc.net/problem/11003👩💻 코드#include #include using namespace std;int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int N, L; cin >> N >> L; deque> dq; for (int i = 0; i > n; if (!dq.empty() && dq.front().second n) { dq.pop_back(); } dq.push_back({n, i}); c..
![[백준] 11003번 : 최솟값 찾기](http://i1.daumcdn.net/thumb/C480x320/?fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FdBK3pk%2FbtsJrSZh7EV%2FQKKdgImHmbffmggPioOFEk%2Fimg.png)