제출 #1278054

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1278054		nuruyeva	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	2 ms	576 KiB

triusis

#include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <stack>
#include <set>
#include <array>
#include <deque>
#include <queue>
#include <cstdio>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <utility>
#include <climits>
#include <iomanip>
#define ll long long
#define endl '\n'
#define fast ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
int main() {
    int n, m;
    cin >> n >> m;
    vector<long long> a(n);
    for (int i = 0; i < n; i++)
    cin >> a[i];
    vector<long long> h(n + 1);
    h[0] = 0;
    for (int i = 1; i <= n; i++) 
    h[i] = a[i - 1];
    int X = 0;
    int Y = 0;
    for (int i = 1; i <= n; i++) {
        if (h[i] - h[i - 1] <= m) {
            Y++; 
            X = max(X, Y);
        } 
        else {
            Y = 0;
        }
    }
    cout << n - X << endl;
    return 0;
}

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