1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
|
#include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define pb push_back
#define SZ(a) ((int) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define lson(var) (var<<1)
#define rson(var) ((var<<1)+1)
using namespace std;
using ll = long long;using ull = unsigned long long;
using DB=double;using LD=long double;
using pdd = pair<DB,DB>;using plb = pair<ll,bool>;
using pll = pair<ll,ll>;
using arr3 = array<ll,3> ;using arr2 = array<ll,2>;
constexpr ll MAXN=static_cast<ll>(1e6)+10,INF=static_cast<ll>(1e17)+9;
constexpr ll mod=static_cast<ll>(1e9)+7;
constexpr double eps=1e-8;const double pi=acos(-1.0);
ll N,M,Q,X,K,lT,H[MAXN],D;
inline void init(){
}
struct cmpda{
bool operator()(ll a,ll b){
return H[a]<H[b];
}
};
struct cmpxiao{
bool operator()(ll a,ll b){
return H[a]>H[b];
}
};
inline void solve(){
cin>>N>>K>>D;
init();
FOR(i,1,N){
cin>>H[i];
}
ll lans2=0;
auto check1=[&](ll mid)->bool{
ll bp=1,res=0;
while(bp<=N){
ll i=bp;
ll mn=H[i],mx=H[i];
bool isB=false;
FOR(j,i,N){
if(abs(H[j]-mn)<=mid && abs(H[j]-mx)<=mid){
mn=min(H[j],mn);
mx=max(H[j],mx);
}else{
bp=j;
++res;
isB=true;
break;
}
}
if(!isB){
++res;
break;
}
}
lans2=res;
if(res>K){
return false;
}
return true;
};
ll l=0,r=mod;
while(l<r){
ll mid=l+r>>1;
if(check1(mid)){
r=mid;
}else{
l=mid+1;
}
}
cout<<l<<"\n";
check1(D);
cout<<lans2<<"\n";
vector<ll> nextPos(N+5,0);
auto cal=[&]()->void{
ll bp=1,res=0;
priority_queue<ll,vector<ll>,cmpda> da;
priority_queue<ll,vector<ll>,cmpxiao> xiao;
FOR(i,1,N){
bool isB=false;
FOR(j,bp,N){
while(da.empty()==false && (da.top()<i || da.top()>j) ){
da.pop();
}
while(xiao.empty()==false && (xiao.top()<i || xiao.top()>j)){
xiao.pop();
}
ll mx=da.empty()?H[j]:H[da.top()],mn=xiao.empty()?H[j]:H[xiao.top()];
if(abs(H[j]-mx)<=D && abs(H[j]-mn)<=D){
xiao.push(j);
da.push(j);
}else{
bp=j;
nextPos[i]=j-1;
isB=true;
break;
}
}
if(!isB){
nextPos[i]=N;
bp=N+1;
}
}
};
cal();
ll mx_k=ceil(log2(K+1))+1;
bitset<32> bik(K);
vector<vector<ll> > jump(N+5,vector<ll>(mx_k+2,0));
ROF(i,N+1,1){
jump[i][0]=i<=N?nextPos[i]+1:N+1;
FOR(j,1,mx_k){
jump[i][j]=jump[jump[i][j-1]][j-1];
}
}
ll ans=0;
FOR(i,1,N){
ll lans=0,idx=i;
FOR(j,0,mx_k){
if(bik[j]){
idx=jump[idx][j];
}
}
lans=idx-i;
ans=max(ans,lans);
}
cout<<ans<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
solve();
return 0;
}
|