Repository navigation
Expand file tree
/
Copy pathasignmment.cpp
More file actions
113 lines (110 loc) · 2.06 KB
/
Copy pathasignmment.cpp
File metadata and controls
113 lines (110 loc) · 2.06 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
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
#include <bits/stdc++.h>
using namespace std;
// Question 1.........................
// Next Greater
int main(){
int n;
cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
vector<int>ans(n);
stack<int>st;
for(int i=n-1;i>=0;i--){
while(st.size()!=0 && st.top()<=v[i]){
st.pop();
}
if(st.empty()){
ans[i]= -1;
}
else{
ans[i]=st.top();
}
st.push(v[i]);
}
for(int i=0;i<n;i++){
cout<<ans[i]<<" ";
}
}
// Question 2.............................
// Previous Greater
int main(){
int n;
cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
vector<int>ans(n);
stack<int>st;
for(int i=0;i<n;i++){
while(!st.empty() && st.top()<=v[i]){
st.pop();
}
if(st.empty()){
ans[i]= -1;
}
else{
ans[i]= st.top();
}
st.push(v[i]);
}
for(int i=0;i<n;i++){
cout<<ans[i]<<" ";
}
}
// Question 3...........................
// Next Smaller
int main(){
int n;
cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
vector<int>ans(n);
stack<int>st;
for(int i=n-1;i>=0;i--){
while(!st.empty() && st.top()>=v[i]){
st.pop();
}
if(st.empty()){
ans[i]= -1;
}
else{
ans[i]=st.top();
}
st.push(v[i]);
}
for(int i=0;i<n;i++){
cout<<ans[i]<<" ";
}
}
// Question 4..........................
// Previus Smaller
int main(){
int n;
cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
vector<int>ans(n);
stack<int>st;
for(int i=0;i<n;i++){
while(!st.empty() && st.top()>=v[i]){
st.pop();
}
if(st.empty()){
ans[i]= -1;
}
else{
ans[i]= st.top();
}
st.push(v[i]);
}
for(int i=0;i<n;i++){
cout<<ans[i]<<" ";
}
}