Broken Keyboard UVA 11988 数组实现链表

这个构造十分巧妙,,,又学到一招，有点类似数组实现的邻接表

 #include <iostream>
 #include <string.h>
 #include <cstdio>
 #include <math.h>
 #define SIGMA_SIZE 26
 #pragma warning ( disable : 4996 )

 using namespace std;
 typedef long long LL;

 inline int Max(int a,int b) { return a>b?a:b; }
 inline int Min(int a,int b) { return a>b?b:a; }
 inline int gcd( int a, int b ) { return b==?a:gcd(b,a%b); }
 inline int lcm( int a, int b ) { return a/gcd(a,b)*b; }  //a*b = gcd*lcm
 const int inf = 0x3f3f3f3f;
 const int maxn = 1e5+;
 const int maxk = 2e6+;

 char str[maxn];
 int nxt[maxn];
 int cur, last;

 void init()
 {
     memset( nxt, , sizeof(nxt) );
     cur = last = ;
 }
 int main()
 {
     while (~scanf("%s", str+))
     {
         init();
         int len = strlen(str+);
         nxt[] = ;

         for ( int i = ; i <= len; i++ )
         {
             char ch = str[i];
             if( ch == '[' ) cur = ;
             else if ( ch == ']' ) cur = last;
             else {
                 nxt[i] = nxt[cur];
                 nxt[cur] = i;
                 if( cur == last ) last = i;
                 cur = i;
             }
         }
         for( int i = nxt[]; i; i = nxt[i] )
             printf( "%c", str[i] );
         printf( "\n" );
     }
 }