uva11988 链表
来源:互联网 发布:上海网站推广优化公司 编辑:程序博客网 时间:2024/06/07 08:33
You’re typing a long text with a broken keyboard. Well it’s not so badly broken. The only problem
with the keyboard is that sometimes the “home” key or the “end” key gets automatically pressed
(internally).
You’re not aware of this issue, since you’re focusing on the text and did not even turn on the
monitor! After you finished typing, you can see a text on the screen (if you turn on the monitor).
In Chinese, we can call it Beiju. Your task is to find the Beiju text.
Input
There are several test cases. Each test case is a single line containing at least one and at most 100,000
letters, underscores and two special characters ‘[’ and ‘]’. ‘[’ means the “Home” key is pressed
internally, and ‘]’ means the “End” key is pressed internally. The input is terminated by end-of-file
(EOF).
Output
For each case, print the Beiju text on the screen.
Sample Input
This_is_a_[Beiju]_text
[[]][][]Happy_Birthday_to_Tsinghua_University
Sample Output
BeijuThis_is_a__text
Happy_Birthday_to_Tsinghua_University
#include<bits/stdc++.h>const int INF = 0x3f3f3f3f;const int Maxn = 100005;#define MST(s,q) memset(s,q,sizeof(s))#define Lchild id<<1#define Rchild (id<<1)+1using namespace std;int Next[Maxn], cur, last;char s[Maxn];int main() { while (scanf("%s", s + 1) == 1) { cur = last = 0; Next[0] = 0; int n = strlen(s + 1); // 写在循环里面竟然超时了 for (int i = 1; i <= n; i++) { if (s[i] == '[') cur = 0; // home key else if (s[i] == ']') cur = last; // end key else { Next[i] = Next[cur]; Next[cur] = i; if (cur == last) last = i; cur = i; } } Next[last] = 0; for (int i = Next[0]; i != 0; i = Next[i]) printf("%c", s[i]); cout << endl; }}
- uva11988(链表)
- uva11988 链表
- UVA11988 Broken Keyboard 链表
- Uva11988 Broken Keyboard 链表
- uva11988
- uva11988
- UVA11988
- UVA11988
- UVa11988
- UVa11988
- UVa11988
- uva11988
- UVA11988
- uva11988 - Broken Keyboard (a.k.a. Beiju Text) 模拟 链表
- UVa11988 Broken Keyboard (a.k.a. Beiju Text)(链表 水)
- ***UVa11988 Broken Keyboard ACM解题报告(链表)
- 【算法竞赛入门经典】6.2链表 例题6-4 UVa11988
- Uva11988 Broken Keyboard (a.k.a. Beiju Text)【链表】【例题6-4】
- MEX -SETUP解决方法,64位WIN8.1安装环境安装2014a
- 数据结构与算法---直接选择排序
- 虚拟的城市之旅 【类spfa】+【正反 建图】
- 关于java中dao,model,service,impl,util的理解
- 有向图-邻接表
- uva11988 链表
- 卷积神经网络学习资料
- HDU 3555 Bomb (数位DP)
- 链表的操作(未解决,排序后无法正确进行插入和删除)
- myeclipse使用jta遇到Error in init: Log already in use? tmlog in ./\错误
- Java操作redis集群和主从
- 银行ATM存取款机系统
- BZOJ4835 [Lydsy2017年4月月赛]遗忘之树
- Javascript获取指定日期