14961 회전 초밥

 

다시보는 초밥문제~

하지만 과거의 자신을 뛰어넘지 못했다는 소식입니다

 

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <bitset>

#define xx first
#define yy second
#define all(x) (x).begin(), (x).end()
#define MAXV 10000005

using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;
using iii = tuple<int, int, int>;

int     main()
{
    int n, d, k, c;
    scanf("%d %d %d %d", &n, &d, &k, &c);

    vector<int> v(n);
    vector<int> count(3005);
    int eat = 0;
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &v[i]);
        if (v[i] == c)
        {
            count[v[i]]++;
            eat = 1;
        }
    }

    for (int i = 0; i < k; i++)
    {
        count[v[i]]++;
        if (count[v[i]] == 1)
            eat++;
    }

    int maxv = eat;
    for (int i = k; i < n; i++)
    {
        count[v[i]]++;
        if (count[v[i]] == 1)
            eat++;
        count[v[i - k]]--;
        if (count[v[i - k]] == 0)
            eat--;
        if (maxv < eat)
            maxv = eat;
    }

    printf("%d\n", maxv);

    return 0;
}

 

아악 원인 알겠다

 

화전초밥인데 회전 안 시켜서 그럼ㅋㅋ

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <bitset>

#define xx first
#define yy second
#define all(x) (x).begin(), (x).end()
#define MAXV 10000005

using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;
using iii = tuple<int, int, int>;

int     main()
{
    int n, d, k, c;
    scanf("%d %d %d %d", &n, &d, &k, &c);

    vector<int> v(n);
    vector<int> count(3005);
    
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &v[i]);
    }

    int eat = 1;
    count[c] = 1;
    for (int i = 0; i < k; i++)
    {
        count[v[i]]++;
        if (count[v[i]] == 1)
            eat++;
    }

    int maxv = eat;
    for (int i = 1; i < n; i++)
    {
        int pre = v[i - 1];
        int nxt = v[(i + k - 1) % n];


        count[nxt]++;
        if (count[nxt] == 1)
            eat++;
        count[pre]--;
        if (count[pre] == 0)
            eat--;
        maxv = max(maxv, eat);
    }

    printf("%d\n", maxv);

    return 0;
}