# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1230303 | dnam | Rabbit Carrot (LMIO19_triusis) | C++20 | 1 ms | 328 KiB |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int m;
cin>>n>>m;
vector<int> a(n);
for(int i=0;i<n;i++) cin>>a[i];
int cnt=0;
int h=0;
for(int i=0;i<n;i++){
if(abs(a[i]-h>m)) cnt++;
else h=a[i];
}
cout<<cnt;
return 0;
}
# | 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... |