| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1343608 | jump | Rabbit Carrot (LMIO19_triusis) | C++20 | 63 ms | 2580 KiB |
#include <bits/stdc++.h>
#define int long long
int n,m;
signed main(){
std::cin >> n >> m;
std::vector<int> lis;
for(int i=1;i<=n;i++){
int in;
std::cin >> in;
if(in>(i*m))continue;
auto itr = std::upper_bound(lis.begin(),lis.end(),i*m-in);
if(itr==lis.end()){
lis.push_back(i*m-in);
}
else{
*itr=i*m-in;
}
}
std::cout << n - lis.size();
}| # | 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... | ||||
