제출 #448391

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
448391		asdf1234coding	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	35 ms	5280 KiB

triusis

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
#define MOD (ll) (1e9+7)

int main() {
    ios_base::sync_with_stdio(false);
    ll n, m; cin>>n>>m;

    vector<int> poles(n);
    for(int i=0; i<n; i++) cin>>poles[i];

    vector<int> possible;

    for(int i=0; i<n; i++) {
        if(poles[i]<=(i+1)*m) {
            possible.push_back((i+1)*m - poles[i]);
        }
    }

    vector<int> LDS;
    for(auto i : possible) {
        int pos = upper_bound(LDS.begin(), LDS.end(), i) - LDS.begin();
        if(pos == LDS.size()) {
            LDS.push_back(i);
        } else {
            LDS[pos] = i;
        }
    }

    cout<<n - LDS.size()<<endl;
    
}

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

triusis.cpp: In function 'int main()':
triusis.cpp:26:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         if(pos == LDS.size()) {
      |            ~~~~^~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 37 / 37