제출 #921966

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
921966		tomb	Rabbit Carrot (LMIO19_triusis)	C++17	0 / 100	1 ms	436 KiB

triusis

#include<bits/stdc++.h>
#define ll long long
#define vll vector<ll>
using namespace std;

int main(){
    int n;
    ll m;
    cin >> n >> m;
    vll poles(n);
    for (int i = 0; i < n; i++) cin >> poles[i];
    ll prev = 0;
    int ans = 0;
    for (ll curr : poles){
        if (curr < prev)
            prev = curr;
        else {
            if (curr - prev > m)
                ans++, prev = prev + m;
            else prev = curr;
        }
    }
    cout << ans << endl;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37