codeforces-264A-Escape from Stones
来源:互联网 发布:公安大数据应用 编辑:程序博客网 时间:2024/05/29 15:58
codeforces-264A-Escape from Stones
time limit per test2 seconds memory limit per test256 megabytes
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.
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.
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.
题目链接:cf-264A
题目大意:初始主角站在区间[0,1]的中点,然后有大量石头掉落(每次都会掉落在当前区间中点),此时主角会向左右移动,每次移动后的区间缩小为1/2。要求:从左往右输出出现的石头编号。
题目思路:
以下是代码:
#include <vector>#include <map>#include <set>#include <algorithm>#include <iostream>#include <cstdio>#include <cmath>#include <cstdlib>#include <string>#include <cstring>using namespace std;int ans[1000010];int main(){ string s; cin >> s; int left = 0,right = s.size() - 1; for (int i = 0; i < s.size(); i++) { if (s[i] == 'l') ans[right--] = i + 1; else ans[left++] = i + 1; } for (int i = 0; i < s.size(); i++) { printf("%d\n",ans[i]); } return 0;}
//- - - - - - - - - – - - - - - - - - - - - - - DFS- - - - - - - - - - - - - - - - - - - - - - - - - - -
#include <vector>#include <map>#include <set>#include <algorithm>#include <iostream>#include <cstdio>#include <cmath>#include <cstdlib>#include <string>#include <cstring>using namespace std;string s; void dfs(int x) { if (s[x] == 0) return; if (s[x] == 'l') { dfs(x + 1); printf("%d\n", x + 1); } else { printf("%d\n", x + 1); dfs(x + 1); } } int main() { cin >> s; dfs(0); return 0; }
- CodeForces 264A Escape from Stones dfs
- codeforces-264A-Escape from Stones
- A. Escape from Stones
- Codeforces 265 Escape from Stones 思维(极限)
- Escape from Stones -DFS
- codeforces 265C - Escape from Stones 思维问题
- [CodeForces264A]Escape from Stones[dfs][two pointers]
- DFS、栈、双向队列:CF264A- Escape from Stones
- CodeForces 266A Stones on the Table
- CodeForces-266A-Stones on the Table
- CodeForces 266A Stones on the Table
- codeforces 266A Stones on the Table
- CODEFORCES 264D Colorful Stones
- Problem--266A--Codeforces--Stones on the Table
- 小白题解 Codeforces 266A Stones on the Table
- codeforces 266A(Stones on the Table) Java
- CodeForces 266 A.Stones on the Table(水~)
- Codeforces Round #163 (Div. 2) / 226A Stones on the Table (字符串处理)
- 第5章 Broadcast
- 触摸事件UITouch的用法
- LeetCode – 4Sum
- 如何两个模板类会相互包含,那么需要在类定义之前声明其中一个类,并且声明时要用模板。
- MFC编程时,OnTimer()函数未被调用解决方法
- codeforces-264A-Escape from Stones
- C语言<string.h>之strspn函数
- play2.0 集成 squeryl
- 杭电2036
- keil4中头文件路径设置的方法汇总
- 排序算法(三):简单选择排序
- 由基频、中频、射频零组件让你一次看懂手机芯片
- C++基础——模板的0初始化
- eclipse下载edit插件并导入github项目到真机运行