#include "bits/stdc++.h"
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...)
#endif
using ll = long long;
using pii = pair<int, int>;
#define F first
#define S second
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll get_rand(ll l, ll r) {
assert(l <= r);
return uniform_int_distribution<ll> (l, r)(rng);
}
struct ST{
int n;
vector<ll> st;
void init(int _n){
n = _n;
st.clear();
st.resize(4 * n + 6, 0);
}
void _update(int id, int l, int r, int pos, int val){
if(l == r){
st[id] = val;
return;
}
int mid = (l + r) >> 1;
if(pos <= mid)
_update(id << 1, l, mid, pos, val);
else
_update(id << 1 | 1, mid + 1, r, pos, val);
st[id] = max(st[id << 1], st[id << 1 | 1]);
}
int _get(int id, int l, int r, int tl, int tr){
if(l > tr or tl > r)
return 0;
if(tl <= l and r <= tr)
return st[id];
int mid = (l + r) >> 1;
return max(_get(id << 1, l, mid, tl, tr), _get(id << 1 | 1, mid + 1, r, tl, tr));
}
void update(int pos, int val){ _update(1, 1, n, pos, val); }
int get(int l, int r) { return _get(1, 1, n, l, r); }
} st;
const int N = 2e5 + 3;
int n, x, t[N], tc[N], f[N];
vector<int> xx;
void solve(){
cin >> n >> x;
for(int i = 1; i <= n; ++i){
cin >> t[i];
xx.push_back(t[i]);
}
xx.push_back(0);
sort(all(xx));
xx.resize(unique(all(xx)) - xx.begin());
st.init(N);
for(int i = n; i >= 1; --i){
tc[i] = lower_bound(all(xx), t[i]) - xx.begin();
f[i] = st.get(tc[i] + 1, N) + 1;
st.update(tc[i], f[i]);
}
int res = *max_element(f + 1, f + n + 1);
st.init(N);
for(int i = 1; i <= n; ++i){
int bound = upper_bound(all(xx), t[i] + x - 1) - xx.begin() - 1;
res = max(res, st.get(1, bound) + f[i]);
st.update(tc[i], st.get(1, tc[i] - 1) + 1);
}
cout << res;
}
int32_t main() {
cin.tie(nullptr)->sync_with_stdio(0);
#define task "troll"
if(fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
int test = 1;
// cin >> test;
for(int i = 1; i <= test; ++i){
// cout << "Case #" << i << ": ";
solve();
}
#ifdef LOCAL
cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
#endif
return 0;
}
Compilation message
glo.cpp: In function 'int32_t main()':
glo.cpp:100:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
100 | freopen(task".inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
glo.cpp:101:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
101 | freopen(task".out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
8536 KB |
Output is correct |
2 |
Correct |
3 ms |
8536 KB |
Output is correct |
3 |
Correct |
3 ms |
8540 KB |
Output is correct |
4 |
Correct |
2 ms |
8540 KB |
Output is correct |
5 |
Correct |
3 ms |
8540 KB |
Output is correct |
6 |
Correct |
2 ms |
8540 KB |
Output is correct |
7 |
Correct |
3 ms |
8796 KB |
Output is correct |
8 |
Correct |
2 ms |
8540 KB |
Output is correct |
9 |
Correct |
2 ms |
8540 KB |
Output is correct |
10 |
Correct |
2 ms |
8540 KB |
Output is correct |
11 |
Correct |
2 ms |
8540 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
8536 KB |
Output is correct |
2 |
Correct |
3 ms |
8536 KB |
Output is correct |
3 |
Correct |
3 ms |
8540 KB |
Output is correct |
4 |
Correct |
2 ms |
8540 KB |
Output is correct |
5 |
Correct |
3 ms |
8540 KB |
Output is correct |
6 |
Correct |
2 ms |
8540 KB |
Output is correct |
7 |
Correct |
3 ms |
8796 KB |
Output is correct |
8 |
Correct |
2 ms |
8540 KB |
Output is correct |
9 |
Correct |
2 ms |
8540 KB |
Output is correct |
10 |
Correct |
2 ms |
8540 KB |
Output is correct |
11 |
Correct |
2 ms |
8540 KB |
Output is correct |
12 |
Correct |
2 ms |
8792 KB |
Output is correct |
13 |
Correct |
2 ms |
8540 KB |
Output is correct |
14 |
Correct |
2 ms |
8540 KB |
Output is correct |
15 |
Correct |
2 ms |
8540 KB |
Output is correct |
16 |
Correct |
3 ms |
8792 KB |
Output is correct |
17 |
Correct |
3 ms |
8540 KB |
Output is correct |
18 |
Correct |
2 ms |
8540 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
8536 KB |
Output is correct |
2 |
Correct |
3 ms |
8536 KB |
Output is correct |
3 |
Correct |
3 ms |
8540 KB |
Output is correct |
4 |
Correct |
2 ms |
8540 KB |
Output is correct |
5 |
Correct |
3 ms |
8540 KB |
Output is correct |
6 |
Correct |
2 ms |
8540 KB |
Output is correct |
7 |
Correct |
3 ms |
8796 KB |
Output is correct |
8 |
Correct |
2 ms |
8540 KB |
Output is correct |
9 |
Correct |
2 ms |
8540 KB |
Output is correct |
10 |
Correct |
2 ms |
8540 KB |
Output is correct |
11 |
Correct |
2 ms |
8540 KB |
Output is correct |
12 |
Correct |
2 ms |
8792 KB |
Output is correct |
13 |
Correct |
2 ms |
8540 KB |
Output is correct |
14 |
Correct |
2 ms |
8540 KB |
Output is correct |
15 |
Correct |
2 ms |
8540 KB |
Output is correct |
16 |
Correct |
3 ms |
8792 KB |
Output is correct |
17 |
Correct |
3 ms |
8540 KB |
Output is correct |
18 |
Correct |
2 ms |
8540 KB |
Output is correct |
19 |
Correct |
3 ms |
8796 KB |
Output is correct |
20 |
Correct |
3 ms |
8796 KB |
Output is correct |
21 |
Correct |
3 ms |
8676 KB |
Output is correct |
22 |
Correct |
3 ms |
8796 KB |
Output is correct |
23 |
Correct |
3 ms |
8796 KB |
Output is correct |
24 |
Correct |
3 ms |
8796 KB |
Output is correct |
25 |
Correct |
3 ms |
8796 KB |
Output is correct |
26 |
Correct |
3 ms |
8796 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
194 ms |
9936 KB |
Output is correct |
2 |
Correct |
211 ms |
11724 KB |
Output is correct |
3 |
Correct |
188 ms |
11724 KB |
Output is correct |
4 |
Correct |
191 ms |
11744 KB |
Output is correct |
5 |
Correct |
89 ms |
10956 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
44 ms |
9188 KB |
Output is correct |
2 |
Correct |
44 ms |
9696 KB |
Output is correct |
3 |
Correct |
46 ms |
9760 KB |
Output is correct |
4 |
Correct |
23 ms |
9436 KB |
Output is correct |
5 |
Correct |
2 ms |
8796 KB |
Output is correct |
6 |
Correct |
27 ms |
9544 KB |
Output is correct |
7 |
Correct |
38 ms |
9696 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
77 ms |
9460 KB |
Output is correct |
2 |
Correct |
80 ms |
10448 KB |
Output is correct |
3 |
Correct |
161 ms |
11748 KB |
Output is correct |
4 |
Correct |
88 ms |
10996 KB |
Output is correct |
5 |
Correct |
58 ms |
9940 KB |
Output is correct |
6 |
Correct |
91 ms |
10964 KB |
Output is correct |
7 |
Correct |
95 ms |
11772 KB |
Output is correct |
8 |
Correct |
66 ms |
10204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
8536 KB |
Output is correct |
2 |
Correct |
3 ms |
8536 KB |
Output is correct |
3 |
Correct |
3 ms |
8540 KB |
Output is correct |
4 |
Correct |
2 ms |
8540 KB |
Output is correct |
5 |
Correct |
3 ms |
8540 KB |
Output is correct |
6 |
Correct |
2 ms |
8540 KB |
Output is correct |
7 |
Correct |
3 ms |
8796 KB |
Output is correct |
8 |
Correct |
2 ms |
8540 KB |
Output is correct |
9 |
Correct |
2 ms |
8540 KB |
Output is correct |
10 |
Correct |
2 ms |
8540 KB |
Output is correct |
11 |
Correct |
2 ms |
8540 KB |
Output is correct |
12 |
Correct |
2 ms |
8792 KB |
Output is correct |
13 |
Correct |
2 ms |
8540 KB |
Output is correct |
14 |
Correct |
2 ms |
8540 KB |
Output is correct |
15 |
Correct |
2 ms |
8540 KB |
Output is correct |
16 |
Correct |
3 ms |
8792 KB |
Output is correct |
17 |
Correct |
3 ms |
8540 KB |
Output is correct |
18 |
Correct |
2 ms |
8540 KB |
Output is correct |
19 |
Correct |
3 ms |
8796 KB |
Output is correct |
20 |
Correct |
3 ms |
8796 KB |
Output is correct |
21 |
Correct |
3 ms |
8676 KB |
Output is correct |
22 |
Correct |
3 ms |
8796 KB |
Output is correct |
23 |
Correct |
3 ms |
8796 KB |
Output is correct |
24 |
Correct |
3 ms |
8796 KB |
Output is correct |
25 |
Correct |
3 ms |
8796 KB |
Output is correct |
26 |
Correct |
3 ms |
8796 KB |
Output is correct |
27 |
Correct |
194 ms |
9936 KB |
Output is correct |
28 |
Correct |
211 ms |
11724 KB |
Output is correct |
29 |
Correct |
188 ms |
11724 KB |
Output is correct |
30 |
Correct |
191 ms |
11744 KB |
Output is correct |
31 |
Correct |
89 ms |
10956 KB |
Output is correct |
32 |
Correct |
44 ms |
9188 KB |
Output is correct |
33 |
Correct |
44 ms |
9696 KB |
Output is correct |
34 |
Correct |
46 ms |
9760 KB |
Output is correct |
35 |
Correct |
23 ms |
9436 KB |
Output is correct |
36 |
Correct |
2 ms |
8796 KB |
Output is correct |
37 |
Correct |
27 ms |
9544 KB |
Output is correct |
38 |
Correct |
38 ms |
9696 KB |
Output is correct |
39 |
Correct |
77 ms |
9460 KB |
Output is correct |
40 |
Correct |
80 ms |
10448 KB |
Output is correct |
41 |
Correct |
161 ms |
11748 KB |
Output is correct |
42 |
Correct |
88 ms |
10996 KB |
Output is correct |
43 |
Correct |
58 ms |
9940 KB |
Output is correct |
44 |
Correct |
91 ms |
10964 KB |
Output is correct |
45 |
Correct |
95 ms |
11772 KB |
Output is correct |
46 |
Correct |
66 ms |
10204 KB |
Output is correct |
47 |
Correct |
92 ms |
10200 KB |
Output is correct |
48 |
Correct |
90 ms |
10432 KB |
Output is correct |
49 |
Correct |
202 ms |
11728 KB |
Output is correct |
50 |
Correct |
88 ms |
10964 KB |
Output is correct |
51 |
Correct |
80 ms |
10644 KB |
Output is correct |
52 |
Correct |
132 ms |
11236 KB |
Output is correct |
53 |
Correct |
94 ms |
11076 KB |
Output is correct |
54 |
Correct |
97 ms |
11728 KB |
Output is correct |
55 |
Correct |
153 ms |
11932 KB |
Output is correct |