**Maximum Element**

### Problem Statement :

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each query is valid.) Constraints 1 < = N < = 10 ^5 1 < = x < = 10^9 1 <= type <= 3 Output Format For each type 3 query, print the maximum element in the stack on a new line.

### Solution :

` ````
Solution in C :
In C ++ :
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <stack>
using namespace std;
int main() {
stack<int> max;
stack<int> s;
max.push(0);
int n;
cin>>n;
while (n--){
int a;
cin>>a;
if(a==1){
cin>>a;
if(a>=max.top()) max.push(a);
s.push(a);
}
else if(a==2){
if(s.top()==max.top()) max.pop();
s.pop();
}
else if(a==3) cout<<max.top()<<endl;
}
return 0;
}
In Java :
import java.io.*;
import java.util.*;
public class Solution {
private static void getMaxElementFromStack()
{
Stack<Integer> stack = new Stack<Integer>();
Stack<Integer> onlyMaxs = new Stack<Integer>();
Scanner sc = new Scanner(System.in);
int N = Integer.parseInt(sc.nextLine());
int temp = 0;
while(sc.hasNext())
{
String type[] = sc.nextLine().split(" ");
switch(type[0])
{
case "1":
temp = Integer.parseInt(type[1]);
stack.push(temp);
if(onlyMaxs.isEmpty() || onlyMaxs.peek() <= temp)
onlyMaxs.push(temp);
break;
case "2":
temp = stack.pop();
if(temp == onlyMaxs.peek())
onlyMaxs.pop();
break;
case "3":
System.out.println(onlyMaxs.peek());
}
N--;
}
while(N-- > 0)
System.out.println(onlyMaxs.peek());
}
public static void main(String[] args) {
getMaxElementFromStack();
}
}
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
typedef struct _node node;
struct _node{
long long int data;
node *next;
};
node* getnode(long long int data){
node *newnode=(node*)malloc(sizeof(node));
newnode->data=data;
newnode->next=NULL;
return newnode;
}
node * push(node *top,int long long data){
node *newnode=getnode(data);
if(top == NULL)
return newnode;
newnode->next=top;
return newnode;
}
node * delete(node *top){
node *temp=top;
top=top->next;
free(temp);
return top;
}
void move(node *fromTop,node *toTop) {
int data=fromTop->data;
delete(fromTop);
push(toTop,data);
}
void printMax(node *maxtop){
printf("%lld\n",maxtop->data);
}
int main() {
int choice;
long long int N;
long long int data;
node *top=NULL,*maxtop=NULL;
scanf("%lld",&N);
while(N) {
scanf("%d",&choice);
if(choice == 1) {
scanf("%lld",&data);
if(top == NULL)
maxtop=push(top,data);
else if(data >= maxtop->data)
maxtop=push(maxtop,data);
top=push(top,data);
}
else if(choice == 2) {
if(top->data == maxtop->data)
maxtop=delete(maxtop);
top=delete(top);
}
else if(choice == 3) {
printMax(maxtop);
}
N--;
}
return 0;
}
In Python3 :
stack = []
max_stack = []
for _ in range(int(input())):
try:
cmd = input()
except:
cmd = '3'
if cmd[0] == '1':
n = int(cmd.split()[1])
stack.append(n)
if len(max_stack) == 0 or max_stack[-1] < n:
max_stack.append(n)
else:
max_stack.append(max_stack[-1])
elif cmd == '2':
stack.pop()
max_stack.pop()
else:
print(max_stack[-1])
```

## View More Similar Problems

## Direct Connections

Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do

View Solution →## Subsequence Weighting

A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =

View Solution →## Kindergarten Adventures

Meera teaches a class of n students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from 1 to n in the clockwise direction. This means that the students are numbered 1, 2, 3, . . . , n-1, n, and students 1 and n are sitting next to each other. After letting the students draw for a certain period of ti

View Solution →## Mr. X and His Shots

A cricket match is going to be held. The field is represented by a 1D plane. A cricketer, Mr. X has N favorite shots. Each shot has a particular range. The range of the ith shot is from Ai to Bi. That means his favorite shot can be anywhere in this range. Each player on the opposite team can field only in a particular range. Player i can field from Ci to Di. You are given the N favorite shots of M

View Solution →## Jim and the Skyscrapers

Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently. Let us describe the problem in one dimensional space

View Solution →## Palindromic Subsets

Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t

View Solution →