-
Notifications
You must be signed in to change notification settings - Fork 28
Expand file tree
/
Copy pathARRAYSUB.cpp
More file actions
68 lines (62 loc) · 1.9 KB
/
ARRAYSUB.cpp
File metadata and controls
68 lines (62 loc) · 1.9 KB
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
/*My First Template :D*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#define MOD (ll)1000000007
#define pb push_back
#define EPS 1e-9
#define FOR(i, a, b) for(int i = a;i <= b; i++)
#define pi(a) printf("%d\n", a)
#define all(c) c.begin(), c.end()
#define tr(container, it) for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define gc getchar_unlocked
#define sdi(a, b) si(a);si(b)
#define io ios_base::sync_with_stdio(false);cin.tie(NULL);
#define endl '\n'
#define mp make_pair
template <typename T> T gcd(T a, T b){return (b==0)?a:gcd(b,a%b);}
template <typename T> T lcm(T a, T b){return a*(b/gcd(a,b));}
template <typename T> T mod_exp(T b, T p, T m){T x = 1;while(p){if(p&1)x=(x*b)%m;b=(b*b)%m;p=p>>1;}return x;}
template <typename T> T invFermat(T a, T p){return mod_exp(a, p-2, p);}
template <typename T> T exp(T b, T p){T x = 1;while(p){if(p&1)x=(x*b);b=(b*b);p=p>>1;}return x;}
void si(int &x){
register int c = gc();
x = 0;
int neg = 0;
for(;((c<48 || c>57) && c != '-');c = gc());
if(c=='-') {neg=1;c=gc();}
for(;c>47 && c<58;c = gc()) {x = (x<<1) + (x<<3) + c - 48;}
if(neg) x=-x;
}
int main(){
io;
int n;
cin>>n;
int arr[n];
FOR(i, 0, n-1) cin>>arr[i];
int k;
cin>>k;
deque<int> d;
for(int i = 0;i < k; i++){
while(!d.empty() && arr[d.back()] < arr[i]){
d.pop_back();
}
d.push_back(i);
}
for(int i = k;i < n; i++){
cout<<arr[d.front()]<<' ';
while(!d.empty() && d.front() <= i-k){
d.pop_front();
}
while(!d.empty() && arr[d.back()] < arr[i]){
// cout<<d.size()<<"HE"<<endl;
d.pop_back();
}
d.push_back(i);
}
cout<<arr[d.front()]<<endl;
return 0;
}