紫书UVa11988

最新推荐文章于 2022-01-19 18:38:53 发布

进击的程序

最新推荐文章于 2022-01-19 18:38:53 发布

阅读量99

点赞数 1

分类专栏：算法入门紫

本文链接：https://blog.csdn.net/weixin_46273288/article/details/111055489

版权

算法入门紫专栏收录该内容

100 篇文章 2 订阅

订阅专栏

在这里插入图片描述


#include<stdio.h>
#include<cstring>
const int maxn = 100000 + 5;
int last, cur, next[maxn];
char s[maxn];
int main()
{	
	while (scanf("%s", s + 1) == 1)
	{
		int n = strlen(s + 1);
		last = cur = 0;
		next[0] = 0;
		for (int i = 1; i <= n; ++i)
		{
			char ch = s[i];
			if (ch == '[')cur = 0;
			else if (ch == ']')cur = last;
			else {
				next[i] = next[cur];
				next[cur] = i;
				if (cur == last)last = i;
				cur = i;
			}
		}
		for (int i = next[0]; i != 0; i=next[i])
		{
			printf("%c", s[i]);

		}
		puts("");
	}
}