제출 #731333

#제출 시각아이디문제언어결과실행 시간메모리
731333dubabubaRabbit Carrot (LMIO19_triusis)C++14
100 / 100
106 ms5332 KiB
#include <bits/stdc++.h> using namespace std; const int mxn = 2e5 + 10; int a[mxn], n, m; vector<int> sus; int LIS() { vector<int> dp; for(int x : sus) { int i = upper_bound(dp.begin(), dp.end(), x) - dp.begin(); if(i == dp.size()) dp.push_back(x); else dp[i] = x; } return dp.size(); } int main() { cin >> n >> m; for(int i = 1; i <= n; i++) { cin >> a[i]; if(m * i - a[i] >= 0) sus.push_back(m * i - a[i]); } cout << n - LIS(); return 0; }

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

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