Codeforces Round #803 (Div. 2) 1698 Rising Sand Solution

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

///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,k,i,t;

    cin>>t;

    while(t--)

    {

        cin>>n>>k;

        int a[n],cn=0;

        for(i=0; i<n; i++)cin>>a[i];

        if(k==1)cout<<(n-1)/2<<endl;

        else

        {

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

            {

                if(a[i-1]+a[i+1]<a[i])

                    cn++;

            }

             cout<<cn<<endl;

        }

    }

}