Submission #516470

#	Time	Username	Problem	Language	Result	Execution time	Memory
516470		Kipras	Rabbit Carrot (LMIO19_triusis)	C++14	0 / 100	1 ms	1468 KiB

triusis

#include <bits/stdc++.h>

using namespace std;

const int maxN = 1e5*3;

int main()
{

    int n, m;
    cin>>n>>m;
    int a[maxN];
    for(int i = 1; i <= n; i++)cin>>a[i];
    int uses=0;
    int curH=0;
    for(int i = 1; i <= n; i++){
        if(curH+m>=a[i])curH=a[i];
        else{ curH=curH+m;uses++;}
    }
    cout<<uses;

    return 0;
}

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