Submission #1278051

#	Time	Username	Problem	Language	Result	Execution time	Memory
1278051		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];
    int sira=0, maxs=0;
    long long h=0;
    for(int i=0;i<n;i++){
        if(i==0){
            if(a[i]<=m) sira=1;
            else sira=0;
            h=a[i];
        }
        else {
            if(a[i]-h<=m){
                sira++;
                h=a[i];
            } 
            else {
                if(sira>maxs) 
                maxs=sira;
                sira=1;
                h=a[i];
            }
        }
    }
    if(sira>maxs)
    maxs=sira;
    cout << n - maxs << endl;
}

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