Codeforces Round #794 (Div. 2) 1686B. Odd Subarrays Solution

 

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

 Solution in C++: 

///La ilaha illellahu muhammadur rasulullah

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

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

///**********ALLAH IS ALMIGHTY************///

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int  n,x,t,i,j,cn,s;

    cin>>t;

    while(t--)

    {

        cn=0;

        cin>>n;

        int a[n+9];

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

        {

            cin>>a[i];

        }

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

        {

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

          {

              cn++;

              i++;

          }

        }

        cout<<cn<<endl;

    }

}