【CodeForces - 264A】Escape from Stones (模擬,卡精度的處理)
題幹:
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
You are given a string s of length n. If the i
Input
The input consists of only one line. The only line contains the string s
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】這個區間,然後有一堆石頭從天而降,每次都是砸在他所在區間的中間,他會選擇向左或者向右跳,問從左到右輸出石頭的編號。
解題報告:
直接開long double 也會炸精度,,,這題其實同時放大幾倍 就好了啊,因為一共有n個操作,所以就用n這麼大的陣列,然後模擬就行了。
AC程式碼:
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<set>
#include<string>
#include<cmath>
#include<cstring>
#define ll long long
#define pb push_back
#define pm make_pair
#define fi first
#define se second
using namespace std;
const int MAX = 1e6 + 6;
char s[MAX];
int a[MAX];
int main()
{
cin>>(s+1);
int len = strlen(s+1);
int l = 1,r = len;
for(int i = 1; i<=len; i++) {
if(s[i] == 'l') a[l++]=i;
else a[r--]=i;
}
for(int i = len; i>=1; i--) printf("%d\n",a[i]);
return 0;
}