제출 #797260

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
797260		dimasnbayu	Rabbit Carrot (LMIO19_triusis)	C++14	0 / 100	1 ms	212 KiB

triusis

#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 l=0, r=v.size()-1;
        int idx=-1;
        while(l<=r){
            int mid=(l+r)/2;
            if(x<=v[mid]){
                r=mid-1;
                idx=mid;
            }
            else l=mid+1;
        }
        if(idx!=-1) v[idx]=x;
        else v.push_back(x);
    }
    int komp=v.size();
    cout<<n-komp<<endl;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37