EC Final 2015(Suffixes and Palindromes-差分约束)

http://blog.csdn.net/skywalkert/article/details/51731556

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b)
#define gmin(a,b) a=min(a,b)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (123456)
int sa[MAXN],rnk[MAXN],fa[MAXN],n,pa[MAXN<<1];

vi e[MAXN];
 //Edge(a,b) == ascii(sa[a]) > ascii(sa[b]) 
char ans[MAXN];
int getfa(int x) {return (fa[x]==x)?x:(fa[x]=getfa(fa[x]));}
void uni(int x,int y) {
    x=getfa(x),y=getfa(y); if (x>y) swap(y,x);fa[y]=x;
}
bool work() {
    n=read();
    For(i,n) {
        fa[i]=i;
        sa[i]=1+read();
        rnk[sa[i]]=i;
        e[i].clear();
    }
    rnk[n+1]=-1;
    For(i,n-1) {
        if (rnk[sa[i]+1]>rnk[sa[i+1]+1]) e[i+1].pb(i); 
    }
    For(i,2*n-1) {
        pa[i]=read();
    }
    For(i,2*n-1) if ((i%2==1 && pa[i]%2==0) || (i%2==0 && pa[i]%2==1 ) ) return 0;
    For(i,2*n-1) {
        if (i%2==1) {
            pa[i]=pa[i]*2-1;
        }
        // 0 -> 1 2 -> 3 4 ->7 6-> 11 8-> 15
        if (i%2==0) {
            if (pa[i]==0) pa[i]=1;
            else pa[i]=pa[i]*2-1;
        } 
    }
    int mx=0,id=0;
    For(i,2*n-1) {
        int cur=0;
        if (mx>i) cur=min(pa[id*2-i]/2,mx-i);
        if (cur*2+1>pa[i]) return 0;

        while(cur*2+1<pa[i]) {
            ++cur;
            int pos1=i-cur,pos2=i+cur;
            if (pos1<1 || pos2>2*n-1) 
                return 0;
            if (pos1%2==1 && pos2%2==1) {
                int gl=rnk[(pos1+1)/2],gr=rnk[(pos2+1)/2];
                if (gl>gr) swap(gl,gr);
                for(gl=getfa(gl),gr=getfa(gr);gl<gr;) {
                    fa[gr]=gr-1;
                    gr=getfa(gr);
                }
            }
        }
        if (cur*2+1==pa[i] && i-cur-1>=1 && i+cur+1<=2*n-1 && (i-cur-1)%2==1) {
            int p1=(i-cur-1+1)/2,p2=(i+cur+1+1)/2;
            if (rnk[p1]<rnk[p2]) {
                e[rnk[p2]].pb(rnk[p1]);
            } else {
                e[rnk[p1]].pb(rnk[p2]);
            }
        }
        if (cur*2+1==pa[i] && i-cur-2>=1 && i+cur+2<=2*n-1 && (i-cur-1)%2==0) {
            int p1=(i-cur-2+1)/2,p2=(i+cur+2+1)/2;
            if (rnk[p1]<rnk[p2]) {
                e[rnk[p2]].pb(rnk[p1]);
            } else {
                e[rnk[p1]].pb(rnk[p2]);
            }
        }

        if (cur+i>mx) {
            mx=cur+i,id=i;
        }
    }
    For(i,n)getfa(i);
    char cur='a';
    for(int i=1;i<=n;i++) {
        int j=i;
        while(j+1<=n && getfa(i)==getfa(j+1)) ++j;
        Fork(k,i,j) {
            for(auto v:e[k]) {
                int p=getfa(v);
                if (p>=i) return 0;
                gmax(cur,(char)(1+ans[sa[p]]));
            }
        }

        if (cur>'z') return 0;
        Fork(k,i,j) ans[sa[k]]=cur;
        i=j;
    }
    ans[n+1]=0;
    return 1;
}
int main()
{
//  freopen("C.in","r",stdin);
//  freopen(".out","w",stdout);
    int T=read();
    For(kcase,T) {
        bool fl=work();
        printf("Case #%d: ",kcase);
        if (!fl) puts("Wrong calculation!");
        else puts(ans+1);
    }
    return 0;
}