forked from rudi8848/data_structures
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1.4.stack_max1.cpp
More file actions
68 lines (60 loc) · 993 Bytes
/
1.4.stack_max1.cpp
File metadata and controls
68 lines (60 loc) · 993 Bytes
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
#include <iostream>
#include <stack>
#include <vector>
#include <utility>
/* std::pair(val, max)*/
struct MaxStack
{
void pushv(int val) {
_st.empty() ? _st.push(std::make_pair(val, val))
: _st.push(std::make_pair(val, std::max(val, _st.top().second)));
}
void popv() {
if (!_st.empty())
_st.pop();
}
int max() {
if (!_st.empty())
return _st.top().second;
else
return -1;
}
private:
std::stack <std::pair<int, int>> _st;
};
void read_commands(int n)
{
std::string command;
int val;
MaxStack st;
int ret;
std::vector<int> log;
while (n != 0)
{
std::cin >> command;
if (command == "max")
{
ret = st.max();
if (ret >= 0)
log.push_back(ret);
}
else if (command == "pop")
st.popv();
else if (command == "push")
{
std::cin >> val;
st.pushv(val);
}
--n;
}
for (int i = 0; i < log.size(); ++i)
std::cout << log[i] << std::endl;
}
int main(void)
{
int n = 0;
std::cin >> n;
if (n)
read_commands(n);
return 0;
}