Submission #28861823

---

Source Code Expand

#include <assert.h>

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = a; i < b; ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, a) rrepi(i, a, 0)
#define rrepi(i, a, b) for (ll i = a - 1; i >= b; --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(), (V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
inline void Yes(bool condition) {
    if (condition)
        PRINT("Yes");
    else
        PRINT("No");
}
template <class itr>
void cins(itr first, itr last) {
    for (auto i = first; i != last; i++) {
        cin >> (*i);
    }
}
template <class itr>
void array_output(itr start, itr goal) {
    string ans = "", k = " ";
    for (auto i = start; i != goal; i++) ans += to_string(*i) + k;
    if (!ans.empty()) ans.pop_back();
    PRINT(ans);
}
ll gcd(ll a, ll b) { return a ? gcd(b % a, a) : b; }

const ll INF = 1e18;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll MOD3 = 1e6;
const ll EPS = 1e-10;
int sgn(const double a) { return (a < -EPS ? -1 : (a > EPS ? +1 : 0)); }
typedef pair<int, int> pi;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> tri;
typedef pair<double, double> point;
typedef complex<double> Point;
const ll MAX = 100005;
constexpr ll nx[4] = {-1, 0, 1, 0};
constexpr ll ny[4] = {0, 1, 0, -1};



int main() {
    ll n;
    cin >> n;
    string s;
    cin >> s;
    vector<ll> cnt(26,0);
    rep(i,n){
        cnt[s[i]-'a']++;
    }
    ll now = 0,r = n-1;
    string t;
    t = s;
    while(r-now > 0){
        ll l = s[now]-'a';
        cnt[l]--;
        ll use = -1;
        rep(i,l){
            if (cnt[i] > 0){
                use = i;
                break;
            }
        }
        if (use == -1){
            now++;
            continue;
        }
        while(s[r]-'a' != use){
            cnt[s[r]-'a']--;
            r--;
        }
        swap(t[now],t[r]);
        now++;
        cnt[s[r]-'a']--;
        r--;
    }
    PRINT(t);
}

Submission Info

Judge Result