| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1355022 | ...2 | Rabbit Carrot (LMIO19_triusis) | C++20 | 5 ms | 344 KiB |
#include<bits/stdc++.h>
using namespace std;
vector<long long> v;
bool change[200005];
int main(){
int n,k;cin>>n>>k;
v.push_back(0);
for(int i=1;i<=n;i++){
long long a;cin>>a;
v.push_back(a);
}
int cnt=0;
for(int i=1;i<=n;i++){
int j=i-1;
while(j>=0 and change[j]==1)j--;
if(v[i]-v[j]<=(i-j)*k)continue;
else{
change[i]=1;
cnt++;
}
}
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... | ||||
