test/next_greatest_element.cpp at main · Alok-Singh-ops/test · GitHub

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
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cctype>
#include<string>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<algorithm>
#include<functional>

using namespace std;

#define ll long long
#define mod 1e9+7


vector<long long> nextLargerElement(vector<long long> arr, int n){
        // Your code here
    vector<long long> op;

    stack<long long> st;
    for (int i = n-1; i >= 0; i--)
    {

      if (st.empty())
        op.push_back(-1);
      else if (st.top()>arr[i] && !st.empty())
      {
        op.push_back(st.top());
      }
      else if (!st.empty() && st.top()<arr[i])
      {
        while (!st.empty()&&st.top()<=arr[i])
        {
          st.pop();
        }
        if(st.empty())
          op.push_back(-1);
        else
          op.push_back(st.top());
      }

      st.push(arr[i]);
    }
    reverse(op.begin(),op.end());
    return op;
  }


int main()
  {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifndef ONLINE_JUDGE
      freopen("input.txt","r", stdin);
      freopen("output.txt","w", stdout);
    #endif//
    // vector<long long> nums1 = {1,3,2,4};
    // vector<long long> op = nextLargerElement(nums1,4);
    // for(int i:op)
    //   std::cout << i << std::endl;
    string ip = "-2";
    std::cout << stoi(ip) << std::endl;

    return 0;
}