제출 #379360

#제출 시각아이디문제언어결과실행 시간메모리
379360LittleCubeRabbit Carrot (LMIO19_triusis)C++14
63 / 100
14 ms3180 KiB
#pragma GCC optimize("O3,unroll-loops") #include <bits/stdc++.h> #pragma pack(0) #define ll long long #define pii pair<int, int> #define pll pair<ll, ll> #define F first #define S second #define MOD 1000000007 #define MOD2 998244353 #define _INFINITY 9223372036854775807 #define fast ios::sync_with_stdio(0), cin.tie(0) using namespace std; ll n, m, arr[100005], res[100005]; vector<ll> dp; signed main() { fast; cin >> n >> m; for (int i = 0; i < n; i++) cin >> arr[i]; for (int i = 0; i < n; i++) arr[i] = ((i + 1) * m) - arr[i]; for (int i = 0; i < n; i++) { if(arr[i] < 0) continue; int pos = upper_bound(dp.begin(), dp.end(), arr[i]) - dp.begin(); if (pos == dp.size()) dp.emplace_back(arr[i]); else dp[pos] = arr[i]; res[i] = dp.size(); } cout << n - dp.size() << '\n'; }

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

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