제출 #923046

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
923046		tvladm2009	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	42 ms	5460 KiB

triusis

#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>

using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double;
const string FILENAME = "input";
const int MAXN = 200228;

int n, d;
int f[MAXN];

void upd(int i, int x) {
	for (; i <= n; i += i & -i) {
		chkmax(f[i], x);
	}
}

int get(int i) {
	int res = 0;
	for (; i >= 1; i -= i & -i) {
		chkmax(res, f[i]);
	}
	return res;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
	cin >> n >> d;
	vector<ll> a(n + 1);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		a[i] -= i * d;
	}
	vector<int> ord(n);
	iota(all(ord), 1);
	sort(all(ord), [&](int i, int j) {
		if (a[i] == a[j]) {
			return i > j;
		}
		return a[i] < a[j];
	});
	for (int i = 1; i <= n; i++) {
		if (a[ord[i - 1]] > 0) {
			break;
		}
		int x = get(n - ord[i - 1] + 1);
		upd(n - ord[i - 1] + 1, x + 1);
	}
	cout << n - get(n) << '\n';
	return 0;
}

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