记录

#include<iostream>
#include<cmath>
using namespace std;
unsigned long long a[250005];
unsigned long long quick_power(long long a,long long b)
{
    unsigned long long ans=1,base=a;
    while(b>0){
        if(b&1) ans*=base;
        base*=base;
        b>>=1;
    }
    return ans;
}
int main()
{
    long long n,sum=0;
    cin>>n;
    for(long long i=1;i<=n;i++) cin>>a[i];
    for(long long i=2;i<=n;i++){
        if(a[i]<a[i-1]){
            unsigned long long t=(a[i-1]/a[i])+(a[i-1]%a[i]?1:0);
            unsigned long long s=(ceil(log(t)/log(2)));
            sum+=s;
            a[i]*=pow(2,s);
        }
    }
    cout<<sum;
    return 0;
}