[백준 2529번] 부등호 (C++)
문제링크 : https://www.acmicpc.net/problem/2529#include using namespace std;typedef long long ll;int n;char arr[11];bool visited[11];string max_s = "";string min_s = "9876543210";void dfs(string s){ if(s.size()==n+1) { max_s = max(max_s, s); min_s = min(min_s, s); return; } for(int i=0; i' && s.back()-'0'i) continue; visited[i] = 1; s.push_back(i+'0'); ..
백준/실버
2025. 3. 10. 19:17