제출 #328165

#제출 시각아이디문제언어결과실행 시간메모리
328165Karen124Global Warming (CEOI18_glo)C++14
17 / 100
128 ms6636 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long int #define F first #define S second #define pb push_back #define md ((b + e) >> 1) #define lc (ind << 1) #define rc (lc | 1) const ll N = 2e5 + 10; const ll LOG = 50; const ll MOD = 1e9 + 7; const ll INF = 1e9 + 10; ll n, add, a[N], b[N], ans; pair <ll, ll> mx[N]; int main() { cin >> n >> add; for (ll i = 0; i < n; i++){ cin >> a[i]; } ll len = 0; for (ll i = 0; i < n; i++){ ll p = lower_bound(b, b + len, a[i]) - b; b[p] = a[i]; len = max(len, p + 1ll); if (i == 0) mx[i] = {p + 1l, -a[0]}; else mx[i] = max(mx[i - 1], {p + 1ll, -a[i]}); } ans = len; fill(b, b + n + 1, 0); len = 0; for (ll i = n - 1; i >= 0; i--){ ll p = lower_bound(b, b + len, -(a[i] + add)) - b; b[p] = -(a[i] + add); len = max(len, p + 1ll); if (i && a[i - 1] < a[i] + add){ ans = max(ans, mx[i - 1].F + p + 1ll); } } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...