1490A - Dense Array.cpp

//                                 ॐ नमः शिवाय
#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
 
// Code Written By: Vikash Patel
// Codeforces Profile: https://codeforces.com/profile/vikashpatel

int solve(int a[], int n)
{
    int c = 0;
    for(int i=1; i<n; i++)
    {
        int maxi = max(a[i], a[i-1]);
        int mini = min(a[i], a[i-1]);
        while(maxi > 2*mini)
        {
            c++;
            mini = mini*2;
        }
    }
    return c;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    // #ifndef ONLINE_JUDGE
    // freopen("input.txt", "r", stdin);
    // freopen("/Users/vikash/Desktop/output.txt", "w", stdout);
    // #endif
    
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        int a[n];
        for(int i=0; i<n; i++)
        {
            cin>>a[i];
        }
        cout<<solve(a, n)<<endl;
    }
    return 0;
}