제출 #1029955

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

triusis

#include<bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=2e5+11;
int n, k, a[N], l[N], ans;
void sol()
{
    cin >> n >> k;
    for(int i=0; i<n; i++) cin >> a[i], a[i]=k*(i+1)-a[i];
//    for(int i=0;i<n;i++) cout << a[i] << ' '; cout << el;
    for(int i=0; i<n; i++)
    {
        int pos=upper_bound(l, l+ans, a[i])-l;
        if(pos==ans) ans++, l[pos]=a[i];
        else l[pos]=min(l[pos], a[i]);
    }
    cout << n-ans;
}
signed main()
{
//    freopen("divisor.INP", "r", stdin);
//    freopen("divisor.OUT", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin >> t;
    while(t--)
    {
        sol();
    }
}

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