1761B - Elimination of a Ring - CodeForces Solution

#include <iostream>
#include <bits/stdc++.h>

#define ll long long
#define dd double
using namespace std;
const int n1 = 1e9 + 7;
int main()
{
    ll t;
    cin >> t;
    while (t--)
    {
        ll n;
        cin>>n;
        ll arr[n];
        set<ll> st;
        for (int i = 0; i < n; i++)
        {
            cin>>arr[i];
            st.insert(arr[i]);
        }
        if (st.size()==2)
        {
            cout<<(n/2)+1<<endl;

        }
        else{
            cout<<n<<endl;
        }
        

        
        
    }
 
    return 0;
}