Codeforces Beta Round #11 A. Increasing Sequence

A. Increasing Sequence
time limit per test1 second
memory limit per test64 megabytes
inputstandard input
outputstandard output
A sequence a0, a1, …, at - 1 is called increasing if ai - 1 < ai for each i: 0 < i < t.

You are given a sequence b0, b1, …, bn - 1 and a positive integer d. In each move you may choose one element of the given sequence and add d to it. What is the least number of moves required to make the given sequence increasing?

Input
The first line of the input contains two integer numbers n and d (2 ≤ n ≤ 2000, 1 ≤ d ≤ 106). The second line contains space separated sequence b0, b1, …, bn - 1 (1 ≤ bi ≤ 106).

Output
Output the minimal number of moves needed to make the sequence increasing.

Examples

input
4 2
1 3 3 2

output
3

My Answer Code:

/*
	Author:Albert Tesla Wizard
	Time:2020/11/7 16:41
*/
#include<bits/stdc++.h>
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n,d,cnt=0;
    cin>>n>>d;
    vector<int>a(n);
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<n-1;i++)
    {
        if(a[i]>=a[i+1])
        {
            cnt+=(a[i]-a[i+1])/d+1;
            a[i+1]+=((a[i]-a[i+1])/d+1)*d;
        }
    }
    cout<<cnt<<'\n';
    return 0;
}