Submission #28964162

---

Source Code Expand

// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
// using P = pair<ll,ll>;
using P = pair<int,int>;
using vint = vector<int>;
using vll = vector<ll>;
using vvint = vector<vector<int>>;
using vvll = vector<vector<ll>>;

// const ll INF = (ll)2e18+9;
const int INF = (int)2e9+7;
// const ll MOD = (ll)1e9+9;
template<typename T>
void chmin(T &a, T b) { a = min(a, b); }
template<typename T>
void chmax(T &a, T b) { a = max(a, b); }

template<typename T>
void print(vector<T> v) {
    int n = v.size();
    rep(i,n) {
        if (i == 0) cout << v[i];
        else cout << ' ' << v[i];
    }
    cout << endl;
}

void solve() {
    ll n;
    cin >> n;
    string s;
    cin >> s;
    s = "0" + s;
    // 一番左にある数
    int lnum = 0;
    rep2(i,1,n+1) {
        if (s[i] == 'L') {
            if (lnum == i-1) lnum = i;
        }
    }
    // cout << lnum << endl;

    vvint config(n+1, vint(2, -1));
    rep2(i,1,n+1) {
        if (s[i] == 'L') {
            int x = config[i-1][0];
            config[i][0] = x;
            config[i][1] = i-1;
            config[i-1][0] = i;
            if (x != -1) config[x][1] = i;
        } else {
            int x = config[i-1][1];
            config[i][1] = x;
            config[i][0] = i-1;
            config[i-1][1] = i;
            if (x != -1) config[x][0] = i;
        }
    }

    vint ans;
    int x = lnum;
    while (config[x][1] != -1) {
        ans.push_back(x);
        x = config[x][1];
    }
    ans.push_back(x);
    print(ans);

    // rep(i,n+1)print(config[i]);
}

int main() {
    solve();
    return 0;
}

Submission Info

Judge Result