#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll wej[200003];
set<pair<ll,ll>> s;
pair<ll,ll> add;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n,m;
cin >> n >> m;
s.insert({0,0});
for (ll i = 1; i<=n; i++){
cin >> wej[i];
auto it=s.lower_bound({wej[i]-m-add.first,-1e9});
add.first+=m;
add.second++;
if (it!=s.end()){
s.insert({wej[i]-add.first,(*it).second-1});
}
}
cout << (*s.begin()).second+add.second << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
352 KB |
Output is correct |
| 7 |
Correct |
0 ms |
352 KB |
Output is correct |
| 8 |
Correct |
1 ms |
352 KB |
Output is correct |
| 9 |
Correct |
1 ms |
352 KB |
Output is correct |
| 10 |
Correct |
0 ms |
352 KB |
Output is correct |
| 11 |
Correct |
0 ms |
352 KB |
Output is correct |
| 12 |
Incorrect |
0 ms |
352 KB |
Output isn't correct |
| 13 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
352 KB |
Output is correct |
| 7 |
Correct |
0 ms |
352 KB |
Output is correct |
| 8 |
Correct |
1 ms |
352 KB |
Output is correct |
| 9 |
Correct |
1 ms |
352 KB |
Output is correct |
| 10 |
Correct |
0 ms |
352 KB |
Output is correct |
| 11 |
Correct |
0 ms |
352 KB |
Output is correct |
| 12 |
Incorrect |
0 ms |
352 KB |
Output isn't correct |
| 13 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
352 KB |
Output is correct |
| 7 |
Correct |
0 ms |
352 KB |
Output is correct |
| 8 |
Correct |
1 ms |
352 KB |
Output is correct |
| 9 |
Correct |
1 ms |
352 KB |
Output is correct |
| 10 |
Correct |
0 ms |
352 KB |
Output is correct |
| 11 |
Correct |
0 ms |
352 KB |
Output is correct |
| 12 |
Incorrect |
0 ms |
352 KB |
Output isn't correct |
| 13 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
352 KB |
Output is correct |
| 7 |
Correct |
0 ms |
352 KB |
Output is correct |
| 8 |
Correct |
1 ms |
352 KB |
Output is correct |
| 9 |
Correct |
1 ms |
352 KB |
Output is correct |
| 10 |
Correct |
0 ms |
352 KB |
Output is correct |
| 11 |
Correct |
0 ms |
352 KB |
Output is correct |
| 12 |
Incorrect |
0 ms |
352 KB |
Output isn't correct |
| 13 |
Halted |
0 ms |
0 KB |
- |
