| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1337867 | 3m17 | Rabbit Carrot (LMIO19_triusis) | C++20 | 2 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
const int Nmax = 3e5 + 27;
#define int long long
int n , M;
int a[Nmax];
pair <int , int> cnt[Nmax];
int Ans , cnt_s;
bool Check (int mid)
{
int cnt = 0;
for (int i = 1 ; i <= n ; i++)
if(a[i] - a[i - 1] > M) cnt++;
return (cnt <= mid);
}
main(){
cin >> n >> M;
for (int i = 1 ; i <= n ; i++)
cin >> a[i];
int l = 0;
int r = n;
while(l <= r)
{
int mid = (l + r) / 2;
if(Check(mid))
{
r = mid - 1;
Ans = mid;
}
else l = mid + 1;
}
cout << Ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
