InterviewCodingQuestions/frog.cpp at main · hiddenHunter291/InterviewCodingQuestions · 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
#include<bits/stdc++.h>
using namespace std;
int main() {
	int n;
	cin >> n;
	vector<int> heights(n);
	vector<int> left(n), right(n);
	for(int i = 0; i < n; ++i) {
		cin >> heights[i];
	}
	stack<int> container;

	for(int i = n - 1; i >= 0; --i) {
		if(container.empty()) {
			container.push(n - 1);
			left[i] = n - 1;
			continue;
		}
		while(!container.empty() && heights[container.top()] >= heights[i]) {
			container.pop();
		}
		if(container.empty()) {
			container.push(i);
			left[i] = n - 1;
		} else {
			left[i] = container.top() - 1;
			container.push(i);
		}
	}

	while(!container.empty())
		container.pop();

	for(int i = 0; i < n; ++i) {
		if(container.empty()) {
			container.push(0);
			right[i] = 0;
			continue;
		}
		while(!container.empty() && heights[container.top()] >= heights[i]) {
			container.pop();
		}
		if(container.empty()) {
			container.push(i);
			right[i] = 0;
		} else {
			right[i] = container.top() + 1;
			container.push(i);
		}
	}

	for(int a : left)
		cout << a << " ";
	cout << endl;
	for(int a : right)
		cout << a << " ";

	return 0;
}