[BOJ] 2531 회전초밥

문제

www.acmicpc.net/problem/2531

2531번: 회전 초밥

 

풀이

1) 처음 풀이 코드(Two Pointer X)

import java.io.*;
import java.util.*;

public class Main {
	static int max = -1;
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int N,d,k,c, cnt,dishes[];
        boolean[] chk;
        //입력
        String op = br.readLine();
        StringTokenizer st = new StringTokenizer(op," ");
        N = Integer.parseInt(st.nextToken());
        d = Integer.parseInt(st.nextToken());
        k = Integer.parseInt(st.nextToken());
        c = Integer.parseInt(st.nextToken());
        chk = new boolean[d+1];
        dishes = new int[N*2];
        
        for(int i=0;i<N;i++) {
        	int num = Integer.parseInt(br.readLine());
        	dishes[i] = dishes[i+N] = num;
        }
        
        //계산
        for(int i=0;i<2*N-k;i++) {
        	Arrays.fill(chk, false);
        	cnt=0;
        	for(int j=0;j<k;j++) {
        		if(!chk[dishes[i+j]]) {
        			chk[dishes[i+j]] = true;
        			cnt++;
        		}
        		//System.out.print(dishes[i+j]+" ");
        	}
        	//System.out.println();
        	if(!chk[c])
        		cnt++;
        	max = cnt>max?cnt:max;
        }
        System.out.println(max);
    }
} 

2) 추가 풀이 방법 코드(Two Pointer O)