Best Reward
来源:互联网 发布:分销平台源码 java 编辑:程序博客网 时间:2024/06/06 03:28
题目描述
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.
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.
输入描述:
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 1, v 2, ..., v 26 (-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 1, the value of 'b' is v 2, ..., and so on. The length of the string is no more than 500000.
输出描述:
Output a single Integer: the maximum value General Li can get from the necklace.
示例1
输入
21 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1aba1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1acacac
输出
16
#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>#include<queue>#include<algorithm>#include<map>#include<iomanip>#define INF 99999999using namespace std; const int MAX=500000+10;char s[MAX*2];int p[MAX*2],sum[MAX],val[27];int per[MAX],pos[MAX]; 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; if(i+p[i] == len+len+2)pos[p[i]-1]=n+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;}
阅读全文
0 0
- Best Reward
- Best Reward
- Best Reward
- 【KMP】 hdu3613 Best Reward
- Best Reward +拓展KMP
- HDOJ 3613 Best Reward
- hdu 3613 Best Reward
- hdu 3613 Best Reward
- HDU3613 Best Reward
- hdu3613---Best Reward
- HDU 3613 Best Reward
- [Manacher][HDU3613][Best Reward]
- HDU 3613 Best Reward
- HDOJ 3613 Best Reward
- hdu 3613 Best Reward
- HDU 3613 Best Reward
- hdu3613 Best Reward(KMP)
- KMP hdu-3613-Best Reward
- 嵌入式C编程中的全局变量重复声明问题
- 设计模式【工厂方法模式】
- javascript 之模块化篇
- 非对称加密------RSA
- 你写的代码,是别人的噩梦吗?
- Best Reward
- 知识 | 梯度下降训练法
- 【面试】算法面试复习总结
- onscroll的用法
- spring框架
- Markdown系列(4)- 你不知道的Markdown基础知识
- kafka技术白皮书
- vue学习笔记
- 性能调优--SQL Server计划缓存