90分，第一个点WA了，求大佬查错

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll inf=0x2fffffffffffffff;
ll a[2005],f[2005],n;

inline ll poww(ll h)
{
    ll sum=1,i,ans=0;
    while(h>sum)
    {
        sum*=2;
        ans++;
    }
    return ans;
}
int main()
{
    //freopen("cs.in","r",stdin);
    int i,h,s,j,k,p;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        f[i]=inf;
    }
    f[1]=0;
    for(i=2;i<=n;i++)
    {//cout<<"(i)"<<i<<endl;
        //for(int q=1;q<=n;q++)cout<<f[q]<<" ";cout<<endl;
        if(a[i]-a[i-1]==1)
        f[i]=f[i-1]+1;
        h=poww(a[i]);
        s=1;p=0;
        for(j=1;j<=h;j++)
        {
            s*=2;//cout<<"*"<<s<<"  *";
            for(k=1;k<i;k++)
            {
                if(a[k]>=a[i]-s)
                {
                p=k;
                if(p+j<=n)
                f[i]=min(f[i],f[p+j]+j+1);
                }
            }
            //cout<<"*p"<<p<<"  *"<<endl;
        }
        //for(int q=1;q<=n;q++)cout<<f[q]<<" ";cout<<endl;cout<<endl;
    }
    if(f[n]==inf)cout<<-1;
    else cout<<f[n];
    return 0; 
}