제출 #1086925

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

triusis

#include <bits/stdc++.h>
using namespace std;

int main(){
    int n, m;
    cin >> n >> m;

    vector<int> heights(n);
    for(int i= 0 ;i<n; i++){
        cin >> heights[i];
    }

    vector<int> difs(n);
    int count = 0;

    difs[0] = heights[0]-m;
    for(int i = 1; i<n; i++){
        difs[i] = heights[i]-heights[i-1]-m;
    }

    int spot = 0;
    while(difs[spot]>0){
        int makeup = difs[spot];
        count++;
        if(spot+1<n){
            difs[spot+1]+=makeup;
        }
        spot++;
    }
    
    while(spot<n){
        if(difs[spot]>0){
            count++;
        }
        spot++;
    }

    cout<<count;

}

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