| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1229150 | buixuia | Rabbit Carrot (LMIO19_triusis) | C++17 | 16 ms | 2752 KiB |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n, m, x, t = 0;
cin>>n>>m;
vector<int> v, b;
for(int i = 1; i <= n; i++){
cin>>x;
if(x <= m * i) b.push_back(m * i - x);
}
for(auto x : b){
auto it = upper_bound(v.begin(), v.end(), x);
if(it == v.end()) v.push_back(x);
else *it = x;
}
cout<<n - v.size()<<'\n';
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... | ||||
