제출 #526822

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
526822		shark25361	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	51 ms	5936 KiB

triusis

#include<bits/stdc++.h>
#include <iomanip>
using namespace std;

#define FIO ios_base::sync_with_stdio(false);cin.tie(0);
#define ll long long
#define for_t ll T;cin>>T;while(T--)
#define endl "\n"
#define F(a,b) for(ll i=a;i<b;i++)
#define mod 1000000007
#define inf 1000000000000000001
#define all(c) c.begin(),c.end()
#define pb push_back

/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,std::less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
*/

void sol()
{
    ll n,m;
    cin >> n >> m;
    ll a[n + 1];
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
        a[i] = (m * i) - a[i];
    }
    vector<ll> v;
    vector<ll>::iterator it;
    for(int i = 1;i <= n;i++)
    {
        if(a[i] < 0)
        {
            continue;
        }
        if(v.empty() || a[i] >= v.back())
        {
            v.pb(a[i]);
        }
        else
        {
            it = upper_bound(all(v),a[i]);
            *it = a[i];
        }
    }
    cout << n - v.size() << endl;
}

int main()
{
    FIO
    //freopen("time.in","r",stdin);
    //freopen("time.out","w",stdout);
    //iota(all(link),0);
    sol();
}

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