제출 #1062111

#제출 시각아이디문제언어결과실행 시간메모리
1062111dpsaveslivesRabbit Carrot (LMIO19_triusis)C++17
100 / 100
22 ms4308 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; cin >> N >> M;
    vector<int> arr(N);
    for(int i = 0;i<N;++i){
        cin >> arr[i];
    }
    reverse(arr.begin(),arr.end());
    vector<int> dp;
    for(int i = 0;i<N;++i){
        int ind = N-i;
        if(arr[i] > M*ind) continue;
        int it = upper_bound(dp.begin(),dp.end(),arr[i]-M*ind)-dp.begin();
        if(it == dp.size()){
            dp.push_back(arr[i]-M*ind);
        }
        else{
            dp[it] = arr[i]-M*ind;
        }
    }

    cout << N-dp.size() << "\n";
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

triusis.cpp: In function 'int main()':
triusis.cpp:18:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |         if(it == dp.size()){
      |            ~~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...