[백준] 2531 회전 초밥 - Brute Force / Java

• 문제 링크

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

 

• 풀이 코드

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

        int[] arr = new int[read()], dup = new int[read() + 1];
        int k = read();
        dup[read()] = arr.length;
        for (int i = 0; i < arr.length; i++) arr[i] = read();

        int cnt = 1;
        for (int i = 0; i < k; dup[arr[i++]]++) if (dup[arr[i]] == 0) cnt++;

        int max = cnt;
        for (int i = 0; i < arr.length - 1; max = Math.max(max, cnt), i++) {
            if (--dup[arr[i]] == 0) cnt--;
            if (++dup[arr[(i + k) % arr.length]] == 1) cnt++;
        }

        bw.write(String.valueOf(max));
        bw.flush();
    }

    private static int read() throws IOException {
        int c, n = System.in.read() & 15;
        while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);

        return n;
    }

}