| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1355023 | ...2 | Rabbit Carrot (LMIO19_triusis) | C++20 | 1 ms | 344 KiB |
#include<bits/stdc++.h>
using namespace std;
vector<long long> v,lis;
int main(){
int n,k;cin>>n>>k;
v.push_back(0);
for(int i=1;i<=n;i++){
long long a;cin>>a;
if(a<=i*k)v.push_back(a);
}
for(int i=0;i<v.size();i++){
auto l=lower_bound(lis.begin(),lis.end(),v[i]);
if(l==lis.end())lis.push_back(v[i]);
else *l=v[i];
}
cout<<n-lis.size();
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... | ||||
