uva 11988 链表 OR 块状链表

链表写法：新增加一个头结点来使插入操作统一。

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

const int N = 100001;
char text[N];
char str[N];
int next[N];
int cur, last, bl;

int main ()
{
    while ( gets(text) )
    {
        int len = strlen(text);
        cur = last = 0;
        bl = 1;
        memset( next, -1, sizeof(next) );
        for ( int i = 0; i < len; i++ )
        {
            if ( text[i] == '[' )
            {
                cur = 0;
            }
            else if ( text[i] == ']' )
            {
                cur = last;
            }
            else
            {
                int tmp = next[cur];
                int ncur = next[cur] = bl++;
                next[ncur] = tmp;
                str[ncur] = text[i];
                if ( cur == last )
                {
                    last = ncur;
                }
                cur = ncur;
            }
        }
        for ( int i = next[0]; i != -1; i = next[i] )
        {
            putchar( str[i] );
        }
        putchar('
');
    }
    return 0;
}

分析了一下感觉块链也可以过，就套模板试了一下，果然没有让我失望，看来我写的块链还是不错的，哈哈。

块链写法：

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

const int M = 100001;
const int N = 500;
char text[M];
char b[N][N];
int sz[N];
int next[N];
int ps, bl;

void init()
{
    bl = 1;
    ps = 400;
    memset( sz, 0, sizeof(sz) );
    memset( next, -1, sizeof(next) );
}

void spilt( int cur )
{
    int tmp = next[cur];
    int ncur = next[cur] = bl++;
    next[ncur] = tmp;
    for ( int i = sz[cur] / 2; i < sz[cur]; i++ )
    {
        b[ncur][sz[ncur]++] = b[cur][i];
    }
    sz[cur] = sz[cur] / 2;
}

void insert( int pos, char val )
{
    int cur = 0, p = sz[cur];
    while ( p < pos + 1 && next[cur] != -1 )
    {
        cur = next[cur];
        p += sz[cur];
    }
    if ( p < pos + 1 )
    {
        b[cur][sz[cur]++] = val;
    }
    else
    {
        p -= sz[cur];
        pos -= p;
        for ( int j = sz[cur] - 1; j >= pos; j-- )
        {
            b[cur][j + 1] = b[cur][j];
        }
        b[cur][pos] = val;
        sz[cur]++;
    }
    if ( sz[cur] > ps ) spilt(cur);
}

int main ()
{
    while ( gets(text) )
    {
        init();
        int ptr = 0, tot = 0;
        for ( int i = 0; text[i] != ''; i++ )
        {
            if ( text[i] == '[' ) 
            {
                ptr = 0;
            }
            else if ( text[i] == ']' )
            {
                ptr = tot;
            }
            else
            {
                insert( ptr++, text[i] );
                tot++;
            }
        }
           for ( int i = 0; i != -1; i = next[i] )
           {
               for ( int j = 0; j < sz[i]; j++ )
               {
                   putchar( b[i][j] );
               }
           }
           putchar('
');
    }
    return 0;
}