301406: CF264A. Escape from Stones

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Escape from Stones

题意翻译

松鼠bored在看小马,现在他要逃避掉下来的石头,石头总是落在bored所在的区间的中间。他有两种选择,一种是向左'l',使区间右端点变为原来的区间中间,一种是向右'r',使区间左端点变为原来的区间中间。bored已经想好了自己的行动路线,为了让他可以继续看小马,请你告诉他下落石头从左到右的编号。

题目描述

Squirrel Liss lived in a forest peacefully, but unexpected trouble happens. Stones fall from a mountain. Initially Squirrel Liss occupies an interval $ [0,1] $ . Next, $ n $ stones will fall and Liss will escape from the stones. The stones are numbered from 1 to $ n $ in order. The stones always fall to the center of Liss's interval. When Liss occupies the interval $ [k-d,k+d] $ and a stone falls to $ k $ , she will escape to the left or to the right. If she escapes to the left, her new interval will be $ [k-d,k] $ . If she escapes to the right, her new interval will be $ [k,k+d] $ . You are given a string $ s $ of length $ n $ . If the $ i $ -th character of $ s $ is "l" or "r", when the $ i $ -th stone falls Liss will escape to the left or to the right, respectively. Find the sequence of stones' numbers from left to right after all the $ n $ stones falls.

输入输出格式

输入格式


The input consists of only one line. The only line contains the string $ s $ ( $ 1<=|s|<=10^{6} $ ). Each character in $ s $ will be either "l" or "r".

输出格式


Output $ n $ lines — on the $ i $ -th line you should print the $ i $ -th stone's number from the left.

输入输出样例

输入样例 #1

llrlr

输出样例 #1

3
5
4
2
1

输入样例 #2

rrlll

输出样例 #2

1
2
5
4
3

输入样例 #3

lrlrr

输出样例 #3

2
4
5
3
1

说明

In the first example, the positions of stones 1, 2, 3, 4, 5 will be ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF264A/c25aff142a5735311a4288820a328b17b4aeb12a.png), respectively. So you should print the sequence: 3, 5, 4, 2, 1.

Input

题意翻译

松鼠bored在看小马,现在他要逃避掉下来的石头,石头总是落在bored所在的区间的中间。他有两种选择,一种是向左'l',使区间右端点变为原来的区间中间,一种是向右'r',使区间左端点变为原来的区间中间。bored已经想好了自己的行动路线,为了让他可以继续看小马,请你告诉他下落石头从左到右的编号。

加入题单

算法标签: