Codes/686C.cpp at main · Bernini0/Codes · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    scanf("%d", &t);
    while (t--)
    {
        int n;
        scanf("%d", &n);
        int arr[n + 1];
        int arr2[n];
        int c = -1, d = -1;
        bool vis[n+1];
        memset(vis,false,sizeof(vis));
        memset(arr, 0, sizeof(arr));
        for (int i = 0; i < n; i++)
        {
            scanf("%d", &c);
            arr2[i] = c;
            vis[c] = true;
            if (c != d)
            {
                d = c;
                arr[c]++;
            }
        }
        // printf("jsdgbf\n");
        // printf("%d\n",arr[1]);

            arr[arr2[0]]--;
            arr[arr2[n - 1]]--;
            if(arr[arr2[0]]==0 || arr[arr2[n-1]]==0){
                printf("1\n");
                continue;
            }
        // if(arr[arr2[0]]==1 || arr[arr2[n-1]]==1){
        //     printf("1\n");
        //     continue;
        // }

        sort(arr2, arr2 + n);
        if (arr2[0] == arr2[n - 1])
        {
            printf("0\n");
            continue;
        }

        sort(arr, arr + n + 1);
        for (int i = 0; i <= n; i++)
        {
            if (arr[i] != 0)
            {
                printf("%d\n", arr[i]+1);
                break;
            }
        }
    }
}