BAEKJOON(백준)1966번 : 프린터 큐 JAVA / PYTHON CODE

 

JAVA CODE

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.StringTokenizer;
import java.util.LinkedList;
 
public class Main {
	public static void main(String[] args) throws IOException {
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		
		int T = Integer.parseInt(br.readLine());
 
		while (T-- > 0) {
			
			StringTokenizer st = new StringTokenizer(br.readLine());
			
			int N = Integer.parseInt(st.nextToken());
			int M = Integer.parseInt(st.nextToken());
			
			LinkedList<int[]> q = new LinkedList<>();
			st = new StringTokenizer(br.readLine());
 
			for (int i = 0; i < N; i++)
				q.offer(new int[] { i, Integer.parseInt(st.nextToken()) });
 
			int count = 0;
			
			while (!q.isEmpty()) {	
				
				int[] front = q.poll();
				boolean isMax = true;	
				
				for(int i = 0; i < q.size(); i++) {
					if(front[1] < q.get(i)[1]) {
						q.offer(front);
						for(int j = 0; j < i; j++) {
							q.offer(q.poll());
						}
						isMax = false;
						break;
					}
				}

				if(isMax == false) {
					continue;
				}

				count++;
				if(front[0] == M) {
					break;
				}
 
			}
 
			sb.append(count).append('\n');
 
		}
		System.out.println(sb);
	}
 
}

 

PYTHON CODE

from collections import deque
import sys

T = int(input())

for i in range(T):
    n, m = map(int, input().split())
    queue = deque(list(map(int, sys.stdin.readline().split())))
    count = 0
    
    while queue:
        best = max(queue)
        front = queue.popleft()
        m -= 1

        if best == front:
            count += 1 
            if m < 0:
                print(count)
                break

        else: 
            queue.append(front)
            if m < 0 : 
                m = len(queue) - 1