#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<queue>

#include<ctime>

#include<vector>

#include<set>

#include<map>

#include<stack>

using namespace std;

#define int long long

const int inf = 1e9+;

int a[],d[],dp[],ddp[],sum1[],sum2[];

vector<int>v[];

signed main(){

    int n,m,i,j,k,x,Ans=;

    scanf("%lld",&n);

    for(i=;i<=n;i++)scanf("%lld",&x),a[i]=x-i;

    a[++n]=inf;d[]=a[]=-inf;

    for(i=;i<=n;i++)d[i]=inf;

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

      int p=upper_bound(d,d+Ans+,a[i])-d;

      Ans=max(Ans,p);

      dp[i]=p;

      d[p]=a[i];

    }

    v[].push_back();

    for(i=;i<=n;i++)v[dp[i]].push_back(i);

    printf("%lld\n",n-Ans);

    ddp[]=;

    for(i=;i<=n;i++)ddp[i]=inf;

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

      for(j=;j<v[dp[i]-].size();j++){

        int to=v[dp[i]-][j];

        if(to>i)break;

        if(a[to]>a[i])continue;

        for(k=to;k<=i;k++)sum1[k]=abs(a[k]-a[to]),sum2[k]=abs(a[k]-a[i]);

        for(k=to+;k<=i;k++)sum1[k]+=sum1[k-],sum2[k]+=sum2[k-];

        for(k=to;k<i;k++)

          ddp[i]=min(ddp[i],ddp[to]+sum1[k]-sum1[to]+sum2[i]-sum2[k]);

      }

    printf("%lld\n",ddp[n]);

    return ;

}