題意：

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; }

?

轉(zhuǎn)載于:https://www.cnblogs.com/fish7/p/4309550.html

總結(jié)

以上是生活随笔為你收集整理的cf 11A Increasing Sequence（水，）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。