제출 #805376

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
805376		olisoe	Rabbit Carrot (LMIO19_triusis)	C++11	100 / 100	23 ms	5328 KiB

triusis

#include "iostream"
#include "vector"
#include "algorithm"
#include "queue"
#include "set"
#include "unordered_set"
#include "stack"
#include "map"
#include "limits.h"
#include "cstdio"
#include "math.h"
#include <numeric>
using namespace std;

int nondec(const vector<int> &seq) {
    vector<int> min_endings;
    for (int i : seq) {
        int pos = upper_bound(min_endings.begin(), min_endings.end(), i) - min_endings.begin();
        if (pos == min_endings.size()) {
            min_endings.push_back(i);
        } else {
            min_endings[pos] = i;
        }
    }
    return min_endings.size();
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n,m;
    cin>>n>>m;
    vector<int> seq;
    for(int i = 0; i<n; i++)
    {
        int num;
        cin>>num;
        seq.push_back(num);
    }
    vector<int> unchanged;
    for(int i = 1; i<=n; i++)
    {
        if(i*m>=seq[i-1])
        {
            unchanged.push_back(i*m-seq[i-1]);
        }
    }
    cout<<n-nondec(unchanged);
}

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

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

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