题目：
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, nstones 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.
Input
The input consists of only one line. The only line contains the string s (1 ≤ |s| ≤ 106). Each character in s will be either "l" or "r".
Output
Output n lines — on the i-th line you should print the i-th stone's number from the left.
Examples
Input
llrlr
Output
3 5 4 2 1
Input
rrlll
Output
1 2 5 4 3
Input
lrlrr
Output
2 4 5 3 1
Note
In the first example, the positions of stones 1, 2, 3, 4, 5 will be , respectively. So you should print the sequence: 3, 5, 4, 2, 1.
解题报告：有一只松鼠，他在【0，1】这个区间，然后有一堆石头从天而降，每次都是砸在他所在区间的中间，他会选择向左或者向右跳，问从左到右输出石头的编号。就是转化思路，假设他向左跳了，说明是他是这个步骤的最右的了，同理向右跳一样。所以直接模拟，输出下标即可。
ac代码：
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
#define inf 0x3f3f3f3f
const int maxn = 1e6+1000;
//注意maxn的大小，一定要开的足够，否则会RE
int main()
{
char str[maxn];
while(cin>>str)
{
int n=strlen(str);
for(int i=0;i<n;i++)
{
if(str[i]=='r')
printf("%d\n",i+1);
}
for(int i=n-1;i>=0;i--)
{
if(str[i]=='l')
printf("%d\n",i+1);
}
}
return 0;
}