제출 #349216

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
349216		gozonite	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	98 ms	7128 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef pair<int, int> pi;
#define MOD 1000000007LL

ll N, M;
vector<ll> a;

int main() {
    //freopen("feast.in", "r", stdin);
    //freopen("feast.out", "w", stdout);
    //ios_base::sync_with_stdio(false);
    //cin.tie(0);
    
    cin >> N >> M;
    a.resize(N+1);
    a[0] = 0;
    for (int i = 1; i <= N; i++) cin >> a[i];
    
    vector<ll> lis{ 0 };
    vector<ll> slis{ 1 };
    for (ll i = 1; i <= N; i++) {
        if (a[i] <= (lis.back() + M*(i-slis.back())) + M) {
            lis.push_back(a[i]);
            slis.push_back(i+1);
        } else if (a[i] > i*M) {
            a[i] = a[i];
        } else {
            int lo = -1, hi = lis.size()-1;
            while (lo < hi) {
                int mid = (lo+hi+1)/2;
                ll val = (lis[mid] + M*(i-slis[mid])) + M;
                if (a[i] <= val) lo = mid;
                else hi = mid-1;
            }
            
            lis[lo+1] = a[i];
            slis[lo+1] = i+1;
        }
        
        //cout << "After round " << i << endl;
        //for (auto x : lis) cout << x << " "; cout << endl;
        //for (auto x : slis) cout << x << " "; cout << endl;
    }
    
    cout << N+1-lis.size() << endl;
}

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