codeforces 11A - Increasing Sequence

得到递增序列

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ls rt<<1
#define rs ls1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-9)
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000007
#define inf 100000007
#define pi acos(-1.0)
#define for(i,a,b) for(int i=(a);i<(b);i++)
#define M 200000+5
int main(){
    int n,d,i,t,cnt,b[2005];
    while(~scanf("%d %d",&n,&d)){
memset(b,0,sizeof(b));
cnt=0;
for(i,1,n+1){
scanf("%d",&b[i]);
t=b[i]-b[i-1];
if(t<=0){
t*=(-1);
t/=d;
t+=1;
}else t=0;
cnt+=t;
b[i]+=(t*d);
}
printf("%d\n",cnt);
}
    return 0;
}