Submission #720530

#	Time	Username	Problem	Language	Result	Execution time	Memory
720530		lalig777	Rabbit Carrot (LMIO19_triusis)	C++14	0 / 100	1 ms	212 KiB

triusis

#include <iostream>
#include <vector>
using namespace std;

int main(){
    int n, m;
    cin>>n>>m;
    vector<long long int>maxim(n+1);
    vector<long long int>poles(n);
    maxim[0]=m;
    vector<int>mod(n+1, 0);
    for (int i=0; i<n; i++) cin>>poles[i];
    for (int i=1; i<=n; i++){
        mod[i]=mod[i-1];
        if (poles[i-1]<=maxim[i-1]) maxim[i]=poles[i-1]+m;
        else{
            mod[i]++;
            maxim[i]=maxim[i-1]+m;
        }
    }cout<<mod[n];
    return 0;
}

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