Codeforces Round #768 (Div. 2) 1631B. Fun with Even Subarrays Solution

 

Problem Link: https://codeforces.com/contest/1631/problem/B

Solve in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long n,t,i,c,r,k,lv;

    cin>>t;

    while(t--)

    {

        r=0,c=1;

        cin>>n;

        int a[n+9];

        for(i=0; i<n; i++)

        {

            cin>>a[i];

        }

        lv=a[n-1];

        for(i=n-2; i>=0; i--)

        {

            if(a[i]==a[i+1])

                c++;

            else

                break;

        }

        while(i>=0)

        {

            r++;

            i-=c;

            c*=2;

            while(i>=0&&a[i]==lv)

            {

                i--,c++;

            }

        }

        cout<<r<<endl;

    }

}