백준 16719번 ZOAC C++

https://www.acmicpc.net/problem/16719

16719번: ZOAC

 

재귀

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

#include <cassert>
#include <utility>

using namespace std;
using int64 = long long;

string str;
vector<bool> visited;

void rec(int left, int right) {
    char minChar = 'z';
    int idx = -1;
    for (int i = left; i <= right; i++) {
        if (visited[i]) continue;
        if (str[i] < minChar) {
            minChar = str[i];
            idx = i;
        }
    }
    if (idx == -1) return;
    visited[idx] = true;
    for (int i = 0; i < visited.size(); i++) {
        if (visited[i] == false) continue;
        cout << str[i];
    }
    cout << "\n";
    rec(idx + 1, right);
    rec(left, idx - 1);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> str;
    visited = vector<bool>(str.length(), false);
    rec(0, str.length() - 1);
}