cf 11A Increasing Sequence（水，）

题意：

A sequence a₀, a₁, ..., a_t - 1 is called increasing if a_i - 1 < a_i for each i: 0 < i < t.

You are given a sequence b₀, b₁, ..., b_n - 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?

思路：

n<=2000，直接暴力

代码：

int n,d;
ll a[2005];

int main(){

    cin>>n>>d;
    rep(i,1,n) scanf("%I64d",&a[i]);
    ll ans=0;
    rep(i,2,n){
        if(a[i]>a[i-1]) continue;
        ll t1=a[i-1]-a[i];
        ans+=(t1/d+1);
        a[i]+=((t1/d+1)*d);
    }
    cout<<ans<<endl;

    return 0;
}

cf 11A Increasing Sequence（水，）

原文：http://www.cnblogs.com/fish7/p/4309550.html