HDU 3613 Best Reward (加权manacher)

题意：

对于字母a~z每个字母都有一个权值

给出一个字符串，让你拆成两部分，如果一段是回文串，这一段的价值就是这一段上所有字母的权值，若不是回文串这一段的总价值为0。求两段的最大总价值。

思路：

先manacher跑一边。由于价值是连续的，所以再跑一边，求出从开头到每一点的总价值，然后枚举每个分割点，对于每个分割点分情况讨论就是了。

代码：

#include <bits/stdc++.h>
using namespace std;
const int MAXN=510000;
const int INF=0x3f3f3f3f;
struct Manacher{
    char Ma[MAXN*2];
    int Mp[MAXN*2];
    int Mx[MAXN*2];
    int val[150];
    int sum[MAXN*2];
    int len;
    double ave;
    int l;
    int ans;
    void ini(){
        l=0;ans=-INF;
        memset(val,0,sizeof(val));
        memset(sum,0,sizeof(sum));
    }
    int manachar(string s,int ll){
        len=ll;
        Ma[l++]='$';
        Ma[l++]='#';
        for(int i=0; i<len; i++)
        {
            Ma[l++]=s[i];
            Ma[l++]='#';
        }
        Ma[l]=0;
        int mx=0,id=0;
        for(int i=0; i<l; i++)
        {
            ave++;
            Mp[i]=mx>i?min(Mp[2*id-i],mx-i):1;
            while(Ma[i+Mp[i]]==Ma[i-Mp[i]]){
                Mp[i]++;
                ave++;
            }
            if(i+Mp[i]>mx)
            {
                mx=i+Mp[i];
                id=i;
            }
            Mx[i]=mx;
        }
        ave/=len;
        for(int i=1;i<l;i++)
            sum[i]+=(sum[i-1]+val[Ma[i]]);
        sum[l]=sum[l-1];
        for(int i=2;i<l-1;i++){
            if(2*Mp[i]==l) continue;
            int tlen=len-(Mp[i]-1);
            if(i-Mp[i]==0){
                int temp=sum[i+Mp[i]-1];
                int pos=l-1-tlen;
                if(Mp[pos]-1==tlen)
                    temp=sum[l];
                ans=max(ans,temp);
            }
            if(i+Mp[i]==l){
                int temp=sum[l]-sum[i-Mp[i]];
                ans=max(ans,temp);
            }
            if((!(i-Mp[i]==0)&&(!(i+Mp[i]==l)))){
                ans=max(ans,0);
            }
        }
        return ans;
    }
    void debug(){
        printf("id:     ");
        for(int i=0;i<l;i++)
            printf("%4d",i);
        printf("\n");
        printf("char:      ");
        for(int i=0;i<l;i++)
            printf("%c   ",Ma[i]);
        printf("\n");
        printf("Mx:     ");
        for(int i=0;i<l;i++)
            printf("%4d",Mx[i]);
        printf("\n");
        printf("Mp:     ");
        for(int i=0;i<l;i++)
            printf("%4d",Mp[i]);
        printf("\n");
        printf("ave: %lf",ave);
        printf("\n");

    }
};
Manacher man;
int main(){
    ios::sync_with_stdio(false);
    int T;
    cin>>T;
    while(T--){
        string str;
        man.ini();
        for(int i=0;i<26;i++)
            cin>>man.val[i+'a'];
        cin>>str;
        int len=str.size();
        cout<<man.manachar(str,len)<<endl;
    }
}
/*
try:
2
-2 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
acacac
1
-2 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
acacac
0
*/

After an uphill battle, General Li won a great victory. Now the head of state decide to reward him with honor and treasures for his great exploit. 

One of these treasures is a necklace made up of 26 different kinds of gemstones, and the length of the necklace is n. (That is to say: n gemstones are stringed together to constitute this necklace, and each of these gemstones belongs to only one of the 26 kinds.) 

In accordance with the classical view, a necklace is valuable if and only if it is a palindrome - the necklace looks the same in either direction. However, the necklace we mentioned above may not a palindrome at the beginning. So the head of state decide to cut the necklace into two part, and then give both of them to General Li. 

All gemstones of the same kind has the same value (may be positive or negative because of their quality - some kinds are beautiful while some others may looks just like normal stones). A necklace that is palindrom has value equal to the sum of its gemstones' value. while a necklace that is not palindrom has value zero. 

Now the problem is: how to cut the given necklace so that the sum of the two necklaces's value is greatest. Output this value. 

Input

The first line of input is a single integer T (1 ≤ T ≤ 10) - the number of test cases. The description of these test cases follows. 

For each test case, the first line is 26 integers: v  ₁, v  ₂, ..., v  ₂₆ (-100 ≤ v  _i≤ 100, 1 ≤ i ≤ 26), represent the value of gemstones of each kind. 

The second line of each test case is a string made up of charactor 'a' to 'z'. representing the necklace. Different charactor representing different kinds of gemstones, and the value of 'a' is v  ₁, the value of 'b' is v  ₂, ..., and so on. The length of the string is no more than 500000. 

Output

Output a single Integer: the maximum value General Li can get from the necklace.

Sample Input

2
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
aba
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
acacac

Sample Output

1
6