#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define int long long
int mod = 1e9+7;
void solve() {
int n,m;
cin>>n>>m;
int a[n];
for(int i=0; i<n; i++)cin>>a[i];
vector<int>temp,b;
for(int i=0; i<n; i++){
if(m*(i+1) >= a[i])
b.pb((i+1)*m-a[i]);
}
int k=b.size();
for(int i=0; i<k; i++){
if(a[i]>0 && temp.empty())temp.pb(a[i]);
else
if(a[i]>temp.back())temp.push_back(a[i]);
else{
int idx=upper_bound(temp.begin(),temp.end(),b[i])-temp.begin();
temp[idx]=b[i];
}
}
int sz;
if(temp.empty())sz=0;
else sz=temp.size();
cout<<n-sz;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
while (t--) {
solve();
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
592 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
592 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
592 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
592 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |