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