C. Escape from Stones
time limit per test
memory limit per test
input
output
[0, 1]. Next, n stones will fall and Liss will escape from the stones. The stones are numbered from 1 to n
[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].
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
Input
s (1 ≤ |s| ≤ 106). 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.
Sample test(s)
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.
不能用模拟double+除法,会爆精度啊!!(long double 也不行)
其实只要根据性质,在序列前后添加即可。
靠,人生中的处女Hack,竟然是被Hack…(受?)