10-InSange

10-InSange

InSange/README.md

@@ -10,5 +10,6 @@
 | 6차시 | 2024.04.01 |  최소신장트리  | [행성 터널](https://www.acmicpc.net/problem/2887)  | [#6](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/24)]
 | 7차시 | 2024.04.04 |  스택  | [문자열 폭발](https://www.acmicpc.net/problem/9935)  | [#7](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/28)]
 | 8차시 | 2024.04.09 |  투 포인터  | [두 용액](https://www.acmicpc.net/problem/2470)  | [#8](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/32)]
-| 9차시 | 2024.04.12 |  힙  | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/)  | [#9](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/34)]
+| 9차시 | 2024.04.12 |  힙  | [Top K Frequent Words](https://leetcode.com/submissions/detail/1180988760/)  | [#9](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/28)]
+| 10차시 | 2024.05.02 |  스택  | [오아시스 재결합](https://www.acmicpc.net/problem/3015)  | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/40)]
 ---

InSange/스택/3015.cpp

@@ -0,0 +1,62 @@
+#include <iostream>
+#include <vector>
+#include <stack>
+
+using namespace std;
+
+long long N, n, a, b, answer;
+vector<int> line;
+stack<pair<int, int>> st;
+
+// a1 보다 b가 크면 종료
+// a1 보다 b가 작다면 다음 b는 
+void Solve()
+{
+	cin >> N;
+
+	for (int i = 0; i < N; i++)
+	{
+		cin >> n;
+		line.push_back(n);
+	}
+
+	for (auto num : line)
+	{
+		int cnt = 1;
+
+		while (!st.empty())
+		{
+			int cur = st.top().first;
+			int cur_cnt = st.top().second;
+			if (cur < num)
+			{
+				answer+= cur_cnt;
+			}
+			else if (cur == num)
+			{
+				answer += cur_cnt;
+				cnt += cur_cnt;
+			}
+			else //if(st.top().first > num)
+			{
+				answer++;
+				break;
+			}
+			st.pop();
+		}
+		//cout << num << ", " << answer << "\n";
+		st.push({num, cnt});
+	}
+
+	cout << answer;
+}
+
+int main()
+{
+	cin.tie(nullptr);
+	ios::sync_with_stdio(false);
+
+	Solve();
+
+	return 0;
+}