제출 #433138

#제출 시각아이디문제언어결과실행 시간메모리
433138jli12345Rabbit Carrot (LMIO19_triusis)C++11
100 / 100
37 ms4168 KiB
#include <bits/stdc++.h> using namespace std; void fastIO(){ ios_base::sync_with_stdio(false); cin.tie(0); } int N, M; int arr[200100]; int main(){ fastIO(); cin >> N >> M; for (int i = 1; i <= N; i++){ cin >> arr[i]; arr[i] -= M*i; arr[i] = -arr[i]; } vector<int> v; for (int i = 0; i <= N; i++){ if (arr[i] < 0) continue; int pos = upper_bound(v.begin(), v.end(), arr[i])-v.begin(); if (pos == v.size()){ v.push_back(arr[i]); } else { v[pos] = arr[i]; } } cout << N+1-v.size() << "\n"; }

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

triusis.cpp: In function 'int main()':
triusis.cpp:25:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         if (pos == v.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...