제출 #857719

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
857719		DP_196	Rabbit Carrot (LMIO19_triusis)	C++14	0 / 100	0 ms	464 KiB

triusis

#include <bits/stdc++.h>

using namespace std;

#define int int64_t
#define sz(x) (int)x.size()
#define MASK(i) ((1LL) << (i))
#define all(x) x.begin(), x.end()
#define BIT(x, i) ((x) >> (i) & (1LL))
#define dbg(...) cerr << "#" << __LINE__ << ":[" << #__VA_ARGS__ \
<< "] = [" ,DBG(__VA_ARGS__)

string to_string(const string& s) { return '"' + s + '"'; }
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
        cerr << to_string(h); if(sizeof...(t)) cerr << ", "; DBG(t...);
}

template <class T>
inline bool maximize(T &a, const T &b) { return (a < b ? (a = b, 1) : 0); }
template <class T>
inline bool minimize(T &a, const T &b) { return (a > b ? (a = b, 1) : 0); }

const int MAXN = 1e5 + 6;
const int INF = 1e18;
const int MOD = 1e9 + 7;

int n, lim, a[MAXN];

void solve() {
    cin >> n >> lim;

    for (int i = 1; i <= n; i++) cin >> a[i];

    int res = 0;

    for (int i = 1; i <= n; i++) {
        if (a[i] > a[i - 1] && a[i] - a[i - 1] > lim) {
            a[i] = a[i - 1] + lim;
            ++res;
            continue;
        }

        if (a[i + 1] - a[i] > lim && a[i] <= a[i - 1]) {
            a[i + 1] = a[i] + lim;
            ++res;
        }
    }

    cout << res;
}

#define TASK ""
int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    int ntest = 1;
    //cin >> ntest;
    while (ntest--) solve();

    return 0;
}
//612

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