Submission #720615

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

triusis

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

int main(){
    int n, m, x;
    cin>>n>>m;
    vector<long long int>maxim(n+1);
    maxim[0]=m;
    vector<int>mod(n+1, 0);
    for (int i=1; i<=n; i++){
        cin>>x;
        mod[i]=mod[i-1];
        maxim[i]=x+m;
        if (x>maxim[i-1]){
            mod[i]++;
            if (i>1 and maxim[i-1]<maxim[i-2]+m and maxim[i-2]+m>=x) maxim[i-1]=maxim[i-2]+m;
            else 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