CodeForces - 11A Increasing Sequence【水题】

【题目描述】
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?

【输入】
The first line of the input contains two integer numbers n and d (2 ≤ n ≤ 2000, 1 ≤ d ≤ 10⁶). The second line contains space separated sequence b0, b1, …, bn - 1 (1 ≤ bi ≤ 10⁶).

【输出】
Output the minimal number of moves needed to make the sequence increasing.

【样例输入】
4 2
1 3 3 2

【样例输出】
3

题目链接：https://codeforces.com/contest/11/problem/A

在原有数列上，对一些数字加若干次d使其递增，求最小次数

代码如下：

#include <iostream>
using namespace std;
static const int MAXN=2000+10;
int a[MAXN];
int n,d;
int main()
{
cin>>n>>d;
for(int i=0;i<n;i++) cin>>a[i];
int cnt=0;
for(int i=1;i<n;i++)
{
if(a[i]>a[i-1]) continue;
int t=(a[i-1]+d-a[i])/d;
cnt+=t;
a[i]+=d*t;
}
cout<<cnt<<endl;
return 0;
}

最后

以上就是跳跃钢笔为你收集整理的CodeForces - 11A Increasing Sequence【水题】的全部内容，希望文章能够帮你解决CodeForces - 11A Increasing Sequence【水题】所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。