CodeForces - 11A ---递增数列

最新推荐文章于 2021-01-02 17:42:57 发布

MallowYi

最新推荐文章于 2021-01-02 17:42:57 发布

阅读量334

点赞数

CC 4.0 BY-SA版权

分类专栏：水题

本文链接：https://blog.youkuaiyun.com/MallowFlower/article/details/79224052

水题专栏收录该内容

52 篇文章

订阅专栏

本文介绍了一个算法问题：给定序列和整数d，求最少操作次数使序列变为递增。输入包括序列长度n、增量d及初始序列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<cstdio>
#include<cstring>
#include<string>
#include<string.h>
#include<cmath>
#include<algorithm>
#include<iostream>
#define ll long long
using namespace std;

int a[2010];
int n, d;
int main(){
    scanf("%d%d", &n, &d);
    for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
    int ans = 0;
    for(int i = 1; i <= n; i++){
        if(a[i] <= a[i-1]){
            int temp = (a[i-1] - a[i] + d) / d;
            a[i] = a[i] + temp*d;
            ans += temp;
        }
    }
    cout << ans << endl;
    return 0;
}

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?

Input

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 b₀, b₁, ..., b_n - 1 (1 ≤ b_i ≤ 10⁶).