CodeForces 11A - Increasing Sequence

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <algorithm>
#include <cctype>
#include <stack>
#include <queue>
#include <string>
#include <cstring>
#include <iomanip>
#include <set>
#include <vector>
#include <cstdio>
#include <stack>
#include <sstream>
#include <cstring>
#include <map>
using namespace std;
int main()
{
double n,d;
double arr[2001];
cin>>n>>d;
int cnt=0;
for(int i=0;i<n;++i)
{
cin>>arr[i];
if(i>=1)
{
while(arr[i]<=arr[i-1])
{
double tmp=ceil((arr[i-1]-arr[i])/d);
if(tmp==0)
{
cnt+=1;
arr[i]+=d;
}
else
{
cnt+=tmp;
arr[i]+=tmp*d;
}
}
}
}
//for(int i=0;i<n;++i)
//	cout<<arr[i]<<endl;
cout<<cnt<<endl;
return  0;
}