2531번

2531

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int n,d,k,c;

int main() {
    int answer = -1;

    cin>>n>>d>>k>>c;
    vector<int> foods;
    for(int i=0;i<n;i++) {
        int food;
        cin>>food;
        foods.push_back(food);
    }

    for(int i=0;i<n;i++) {
        vector<bool> visited(3001, false);
        int cnt = 1;
        int food_sum = 1;
        visited[foods[i]] = true;
        
        for(int j=i+1;j<n;j++) {
            if(cnt<k){
                if(!visited[foods[j]]) {
                    visited[foods[j]] = true;
                    food_sum++;
                }
            } else break;
            cnt++;
        }
        if(cnt<k) {
            for(int j=0;j<k-cnt;j++) {
                if(!visited[foods[j]]) {
                    visited[foods[j]] = true;
                    food_sum++;
                }
            }
        }

        if(!visited[c]) {
            food_sum++;
        }
        answer = max(answer, food_sum);
    }
    cout<<answer;
}