제출 #1187581

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1187581		ffeyyaae_	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	2 ms	328 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+5;
int n, M;
int keep[N];
int main()
{
    cin >> n >> M;
    for( int i=1;i<=n;i++ )
    {
        int a; cin >> a;
        keep[i] = M*i - a;
    }
    vector<int> vec;
    for( int i=0;i<=n;i++ )
    {
        int idx = upper_bound( vec.begin(), vec.end(), keep[i] )-vec.begin();
        if( idx == vec.size() ) vec.push_back( keep[i] );
        else vec[idx] = keep[i];
    }
    cout << n-vec.size()+1;
    return 0;
}

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