-
백준 10799번: 쇠막대기스택(Stack) 2018. 9. 29. 19:19반응형
https://www.acmicpc.net/problem/10799
1. 문제
2. 알고리즘
키워드 - 스택
3. 코드
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960#include <iostream>#include <sstream>#include <string>#include <algorithm>#include <functional>#include <vector>#include <list>#include <queue>#include <deque>#include <map>#include <set>#include <stack>#include <math.h>#include <memory.h>using namespace std;#define MAX_SIZE 100#define INF 0x7fffffff#define CENDL "\n"#define ll long long#define c_reverse(s) reverse(s.begin(), s.end())#define c_sort(s) sort(s.begin(), s.end())#define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i];int main() {cin.tie(0);std::ios::sync_with_stdio(false);string ss; cin >> ss;int answer = 0;const int size = ss.size();stack<char> s;char before = 0;for (int i = 0; i < size; i++) {if (ss[i] == '(') {s.push(ss[i]);}else {s.pop();if (before == '(')answer += s.size();elseanswer++;}before = ss[i];}cout << answer << CENDL;return 0;}cs 반응형'스택(Stack)' 카테고리의 다른 글
monotone stack (0) 2019.08.24 스택/큐 > 다리를 지나는 트럭 (0) 2018.09.29 백준 3015번: 오아시스 재결합 (0) 2018.07.01 백준 9012번: 괄호 (0) 2018.06.14