| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1349341 | karn7777 | Rabbit Carrot (LMIO19_triusis) | C++20 | 45 ms | 4080 KiB |
#include<bits/stdc++.h>
#define int long long
#define N 200005
using namespace std;
int arr[N];
signed main(){
vector<int> vec;
int n,k;
cin >> n >> k;
for(int i=1;i<=n;i++){
cin >> arr[i];
arr[i]=(arr[i]-k*i);
}
for(int i=n;i>=1;i--){
if(arr[i]<=0){
auto it=upper_bound(vec.begin(),vec.end(),arr[i]);
if(it==vec.end())vec.push_back(arr[i]);
else *it=arr[i];
}
}
cout << n-vec.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... | ||||
