hdu3613之manacher算法

Best Reward

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 364    Accepted Submission(s): 144

Problem Description

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
  
  
  
  


  
  

manacher算法详解:http://blog.csdn.net/xingyeyongheng/article/details/9310555

另一种KMP做法:http://blog.csdn.net/xingyeyongheng/article/details/9292449

另一种EKMP做法:http://blog.csdn.net/xingyeyongheng/article/details/9386235

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#define INF 99999999
using namespace std;

const int MAX=500000+10;
char s[MAX*2];
int p[MAX*2],sum[MAX],val[27];//sum为前i个字符价值和 
int per[MAX],pos[MAX];//per标记前i个字符为回文串,pos标记后i个字符为回文串 

int main(){
	int n;
	cin>>n;
	while(n--){
		for(int i=0;i<26;++i)scanf("%d",&val[i]);
		scanf("%s",s);
		int len=strlen(s),id=0,ans=-INF,temp=0;
		for(int i=1;i<=len;++i)sum[i]=sum[i-1]+val[s[i-1]-'a'];
		for(int i=len;i>=0;--i){
			s[i+i+2]=s[i];
			s[i+i+1]='#';
		}
		s[0]='*';
		for(int i=2;i<len+len+1;++i){
			if(p[id]+id>i)p[i]=min(p[2*id-i],p[id]+id-i);
			else p[i]=1;
			while(s[i-p[i]] == s[i+p[i]])++p[i];
			if(id+p[id]<i+p[i])id=i;
			if(i-p[i] == 0)per[p[i]-1]=n+1;//表示前缀(前p[i]-1个字符)是回文串
			if(i+p[i] == len+len+2)pos[p[i]-1]=n+1;//表示后缀(后p[i]-1个字符)是回文串
		}
		for(int i=1;i<len;++i){
			if(per[i] == n+1)temp+=sum[i];
			if(pos[len-i] == n+1)temp+=sum[len]-sum[i];
			if(temp>ans)ans=temp;
			temp=0;
		}
		cout<<ans<<endl;
	}
	return 0;
}