LR insertion

AtCoder

IDabc237_d

Time2000ms

Memory256MB

Difficulty—

There is a sequence that contains one $0$, $A=(0)$. Additionally, you are given a string of length $N$, $S=s_1s_2\ldots s_N$, consisting of `L` and `R`. For each $i=1, 2, \ldots, N$ in this order, the following will be done. * If $s_i$ is `L`, insert $i$ to the immediate left of $i-1$ in $A$. * If $s_i$ is `R`, insert $i$ to the immediate right of $i-1$ in $A$. Find the final contents of $A$. ## Constraints * $1\leq N \leq 5\times 10^5$ * $N$ is an integer. * $|S| = N$ * $s_i$ is `L` or `R`. ## Input Input is given from Standard Input in the following format: $N$ $S$ [samples]

Samples

Input #1

5
LRRLR

Output #1

1 2 4 5 3 0

Initially, $A=(0)$.  
$S_1$ is `L`, which makes it $A=(1,0)$.  
$S_2$ is `R`, which makes it $A=(1,2,0)$.  
$S_3$ is `R`, which makes it $A=(1,2,3,0)$.  
$S_4$ is `L`, which makes it $A=(1,2,4,3,0)$.  
$S_5$ is `R`, which makes it $A=(1,2,4,5,3,0)$.

Input #2

7
LLLLLLL

Output #2

7 6 5 4 3 2 1 0

API Response (JSON)

{
  "problem": {
    "name": "LR insertion",
    "description": {
      "content": "There is a sequence that contains one $0$, $A=(0)$.   Additionally, you are given a string of length $N$, $S=s_1s_2\\ldots s_N$, consisting of `L` and `R`. For each $i=1, 2, \\ldots, N$ in this order, t",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc237_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "There is a sequence that contains one $0$, $A=(0)$.  \nAdditionally, you are given a string of length $N$, $S=s_1s_2\\ldots s_N$, consisting of `L` and `R`.\nFor each $i=1, 2, \\ldots, N$ in this order, t...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments