This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/**
* Author: Anil Byar
**/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// template<class T>
// using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x).size()
#define ft first
#define sd second
#define pb push_back
// Source: https://codeforces.com/blog/entry/68809
// { start
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// } end
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vl> vvl;
#define dbg if(0)
const ll MOD = 998244353;
const ll INFLL = 1e18+5;
const int INF = 1e9;
const int maxN = 101;
const int maxK = 8001;
void printbit(int x, int len) {string s="\n";while(len--){s=((x%2)?'1':'0')+s;x/=2;} cout<<s;}
ll power(ll x, ll y){if (y==0) return 1;ll ret = power(x, y/2);ret *= ret;ret%=MOD;if (y&1) ret *= x;return ret%MOD;}
ll modinv(ll x, ll mod = MOD) {return power(x, mod-2);}
template<class T>
istream& operator>>(istream&in, vector<T>&v){
for (T& x:v) in>>x;
return in;
}
template<class T>
ostream& operator<<(ostream&out, vector<T>&v){
for (T& x:v) out<<x<<' ';
cout<<'\n';
return out;
}
void solve(){
int n, x;cin>>n>>x;
vi a(n);
cin>>a;
vi dec(n, -1);
vi declen(n, -1);
{
vi b = a;
vi tmp(n, -INF);
int lst = n-1;
for (int i = n-1;i>=0;i--){// 2 4 7 // 3
{
int pos = upper_bound(all(tmp), b[i]-x) - tmp.begin() - 1;
declen[i] = n-pos;
}
int pos = upper_bound(all(tmp), b[i]) - tmp.begin() - 1;
if (tmp[pos]==-1) lst = pos;
tmp[pos] = b[i];
dec[i] = tmp[lst];
}
}
vi inc(n, INF);
vi inclen(n, 0);
int lst = 0;
for (int i= 0;i<n;i++){
int pos = lower_bound(all(inc), a[i])-inc.begin();
if (inc[pos]==INF) lst = pos;
inc[pos] = a[i];
inclen[i] = pos+1;
// 1 2 3 3 4 5 // x = 0
}
// debug(declen);
int ans = 0;
for (int i = 0;i<n;i++){
ans = max(ans, inclen[i] + declen[i] - 1);
}
cout<<ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
// #define _DEBUG
#ifdef _DEBUG
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
int tt = clock();
#endif
int t=1, i = 1;
// cin>>t;
while(t--){
// cout<<"Case #"<<i++<<": ";
solve();
cout<<'\n';
}
#ifdef _DEBUG
cerr << "TIME = " << (float)(clock() - tt)/CLOCKS_PER_SEC << endl;
tt = clock();
#endif
}
Compilation message (stderr)
glo.cpp: In function 'void solve()':
glo.cpp:114:9: warning: variable 'lst' set but not used [-Wunused-but-set-variable]
114 | int lst = 0;
| ^~~
glo.cpp: In function 'int main()':
glo.cpp:142:14: warning: unused variable 'i' [-Wunused-variable]
142 | int t=1, i = 1;
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |