제출 #797263

#제출 시각아이디문제언어결과실행 시간메모리
797263dimasnbayuRabbit Carrot (LMIO19_triusis)C++14
100 / 100
22 ms3028 KiB
#include <bits/stdc++.h>
using namespace std;
#define start cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
#define endl '\n'
#define pii pair<int,int>
#define pll pair<long long, long long>
#define fflush(stdout); cout.flush();

/*********************************/
/*********************************/

int a[200005], b[200005];
int main(){
	start
    int n, m; cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        b[i]=(m*i)-a[i];
    }   
    
    vector<int>v;
    for(int i=1;i<=n;i++){
        int x=b[i];
        if(x<0) continue;
        int idx=upper_bound(v.begin(), v.end(), x) - v.begin();
        if(idx==v.size()) v.push_back(x);
        else v[idx]=x;
    }
    int komp=v.size();
    cout<<n-komp<<endl;
}

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

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