Description
Let's play the game Zuma!
There are a sequence of beads on a track at the right beginning. All the beads are colored but no three adjacent ones are allowed to be with a same color. You can then insert beads one by one into the sequence. Once three (or more) beads with a same color become adjacent due to an insertion, they will vanish immediately.
Note that it is possible for such a case to happen for more than once for a single insertion. You can't insert the next bead until all the eliminations have been done.
Given both the initial sequence and the insertion series, you are now asked by the fans to provide a playback tool for replaying their games. In other words, the sequence of beads after all possible eliminations as a result of each insertion should be calculated.
Input
The first line gives the initial bead sequence. Namely, it is a string of capital letters from 'A' to 'Z', where different letters correspond to beads with different colors.
The second line just consists of a single interger n, i.e., the number of insertions.
The following n lines tell all the insertions in turn. Each contains an integer k and a capital letter Σ, giving the rank and the color of the next bead to be inserted respectively. Specifically, k ranges from 0 to m when there are currently m beads on the track.
Output
n lines of capital letters, i.e., the evolutionary history of the bead sequence.
Specially, "-" stands for an empty sequence.
描述
祖玛是一款曾经风靡全球的游戏，其玩法是：在一条轨道上 初始排列着若干个彩色珠子，其中任意三个相邻的珠子不会完全同色。此后，你可以发射珠子到轨道上并加入原有序列中。一旦有三个或更多同色的珠子变成相邻， 它们就会立即消失。这类消除现象可能会连锁式发生，其间你将暂时不能发射珠子。
开发商最近准备为玩家写一个游戏过程的回放工具。他们已经在游戏内完成了过程记录的功能，而回放功能的实现则委托你来完成。
游戏过程的记录中，首先是轨道上初始的珠子序列，然后是玩家接下来所做的一系列操作。你的任务是，在各次操作之后及时计算出新的珠子序列。
输入
第一行是一个由大写字母'A'~'Z'组成的字符串，表示轨道上初始的珠子序列，不同的字母表示不同的颜色。
第二行是一个数字n，表示整个回放过程共有n次操作。
接下来的n行依次对应于各次操作。每次操作由一个数字k和一个大写字母Σ描述，以空格分隔。其中，Σ为新珠子的颜色。若插入前共有m颗珠子，则k ∈ [0, m]表示新珠子嵌入之后（尚未发生消除之前）在轨道上的位序。
这是一道链表的练习题，双向链表模拟即可。
然而在别的博客看到了strcmp模拟的解法，又快又方便。
果断学（chao）一下。
1 /*By SilverN*/ 2 #include<iostream> 3 #include<cstdio> 4 #include<cmath> 5 #include<cstring> 6 #include<algorithm> 7 using namespace std; 8 char s[24000]; 9 char tmp[24000]; 10 int len=0; 11 int n,pos; 12 char ch; 13 bool solve(int po){ 14 int l=po,r=po; 15 while(l && s[l-1]==s[po]) --l; 16 while(s[r]==s[po] && r<len) ++r; 17 if(r-l>2){ 18 strcpy(tmp,s+r); 19 strcpy(s+l,tmp); 20 len-=r-l; 21 pos=l; 22 return 1; 23 } 24 return 0; 25 } 26 int main(){ 27 freopen("hao.in","r",stdin); 28 freopen("hao.out","w",stdout); 29 gets(s); 30 int i,j; 31 len=strlen(s); 32 scanf("%d",&n); 33 for(i=1;i<=n;++i){ 34 scanf("%d %c",&pos,&ch); 35 strcpy(tmp,s+pos); 36 s[pos]=ch;++len;//插入 37 strcpy(s+pos+1,tmp); 38 while(len){ if(!solve(pos))break; } 39 if(!len)printf("%c ",'-'); 40 else printf("%s ",s); 41 } 42 return 0; 43 }