제출 #996618

#제출 시각아이디문제언어결과실행 시간메모리
996618oj123Rabbit Carrot (LMIO19_triusis)C++14
63 / 100
52 ms5064 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back #define ll long long #define f first #define s second int main() { int n, m; cin >> n >> m; vector<ll> v; for (int i = 1; i <= n; i++) { ll a; cin >> a; v.pb((a - (m * i))); } reverse(v.begin(), v.end()); vector<ll> v1; for (int i : v) { if (i <= 0) { int pos = upper_bound(v1.begin(), v1.end(), i) - v1.begin(); if (pos == v1.size()) { v1.pb(i); } else { if (v1[pos] != 0) { v1[pos] = i; } } } } cout << n - v1.size() << endl; }

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

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