📦 ved015 / Codeforces-solution

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#include<iostream>
#include<vector>
using namespace std;
int main(){
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        vector<int> nums(n);
        for(int i = 0; i < n; i++){
            cin >> nums[i];
        }
        int val = nums[0];
        int count = 0;
        int mini = INT_MAX;
        for(int i = 0; i<n; i++){
            if(nums[i] == val){
                count++;
            }
            else{
                mini = min(mini,count);
                count = 0;
            }
        }
        mini = min(mini,count);
        if(mini == nums.size()) cout << -1 << endl;
        else cout << mini << endl;
    }
    return 0;
}