제출 #1289309

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289309		blackscreen1	Global Warming (CEOI18_glo)	C++20	100 / 100	56 ms	6228 KiB

glo

#include <bits//stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_multiset;
#define ll long long
#define ld long double
#define iloop(m, h) for (ll i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define iloop_(m, h, g) for (auto i = m; i < h; i += g)
#define jloop_(m, h, g) for (auto j = m; j < h; j += g)
#define kloop_(m, h, g) for (auto k = m; k < h; k += g)
#define lloop_(m, h, g) for (auto l = m; l < h; l += g)
#define getchar_unlocked _getchar_nolock // comment before submission
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define pllll pair<pll, pll>
#define vll vector<ll>
#define qll queue<ll>
#define dll deque<ll>
#define pqll priority_queue<ll>
#define gll greater<ll>
#define INF 1000000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll n, m;
	cin >> n >> m;
	ll a[n];
	iloop(0, n) cin >> a[i];
	ll dp[n], sv[n];
	vector<ll> tops;
	iloop(0, n) {
		sv[i] = (i ? lower_bound(tops.begin(), tops.end(), a[i] + m) - tops.begin() : 0);
		if (!tops.size() || tops.back() < a[i]) {tops.push_back(a[i]); dp[i] = tops.size();}
		else {
			ll id = lower_bound(tops.begin(), tops.end(), a[i]) - tops.begin();
			tops[id] = a[i];
			dp[i] = id + 1;
		}
	} 
	tops.clear();
	ll tmp, cans = 0;
	iloop(n-1, -1) {
		a[i] *= -1;
		if (!tops.size() || tops.back() < a[i]) {tops.push_back(a[i]); tmp = tops.size();}
		else {
			ll id = lower_bound(tops.begin(), tops.end(), a[i]) - tops.begin();
			tops[id] = a[i];
			tmp = id + 1;
		}
		cans = max(cans, sv[i] + tmp);
	}
	cout << cans;
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 13 / 13
• Subtask 4: 10 / 10
• Subtask 5: 20 / 20
• Subtask 6: 17 / 17
• Subtask 7: 25 / 25