제출 #545167

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
545167		AA_Surely	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	43 ms	5372 KiB

triusis

#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;
typedef long long 		LL;

typedef pair<int, int> 	PII;
typedef pair<LL, LL> 	PLL;

typedef vector<int> 	VI;
typedef vector<LL> 		VLL;
typedef vector<PII> 	VPII;
typedef vector<PLL> 	VPLL;

const int MAXN = 2e5 + 7;
const int ALPHA = 27;
const LL INF = 1e18 + 7;
const int MOD = 1e9 + 7;
const int LOG = 22;

LL n, ns[MAXN], lis[MAXN], m;

int main() {
    IOS;
    
    cin >> n >> m;
    F0R(i, n) {
        cin >> ns[i];
        ns[i] -= m * (i + 1);
        if (ns[i] > 0) ns[i] = INF;
    }

    fill(lis + 1, lis + n + 1, INF);
    lis[0] = -INF;

    R0F(i, n) {
        int place = upper_bound(lis, lis + n, ns[i]) - lis;
        lis[place] = min(lis[place], ns[i]);
    }

    int ans = 0;
    F0R(i, n + 1) if (lis[i] != INF) ans = i;
    cout << n - ans;
}

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