This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
long long n, br, a[200005], sol = 0;
cin >> n >> br;
for (int i = 0; i < n; i++)
{
cin >> a[i];
if (i == 0)
{
if (a[i]>br)
sol++;
a[i]=br;
}
else
{
if (a[i]>a[i-1]+br)
{
sol++;
if (a[i]-(max(a[i-2], a[i-1])+br)<=br)
{
a[i-1]=max(a[i-1],a[i-2])+br;
}else a[i]=a[i-1]+br;
}
}
}
cout << sol;
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... |