Best Reward +拓展KMP
来源:互联网 发布:网络教学平台建设方案 编辑:程序博客网 时间:2024/05/02 01:15
Best Reward
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/65536K (Java/Other)
Total Submission(s) : 27 Accepted Submission(s) : 11
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.
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: v1, v2, ..., v26 (-100 ≤ vi ≤ 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 v1, the value of 'b' is v2, ..., and so on. The length of the string is no more than 500000.
For each test case, the first line is 26 integers: v1, v2, ..., v26 (-100 ≤ vi ≤ 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 v1, the value of 'b' is v2, ..., 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
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
Sample Output
16#include<cstdio>#include<algorithm>#include<cstring>using namespace std;#define MAX 500005char s[MAX<<1];int nextx[MAX<<1],value[30];int summ[MAX],v[2][MAX];int n,m;void get_nextx(){ int i=0,j=-1; nextx[0]=-1; for(;i<m;) if(j==-1||s[i]==s[j]) { ++i;++j; nextx[i]=j; } else j=nextx[j];}void check(int x){ summ[0]=0; for(int i=0;i<n;++i) summ[i+1]=summ[i]+value[s[i]-'a']; reverse_copy(s,s+n,s+n+1); s[n]='#'; get_nextx(); memset(v[x],0,sizeof(v[x])); int p=m; for(;;) { p=nextx[p]; if(!~p) break; v[x][p]=summ[p]; }}int main(){ int cas; scanf("%d",&cas); for(;cas--;) { int ans=-((1<<25)-1); for(int i=0;i<26;++i) scanf("%d",&value[i]); scanf("%s",s); n=strlen(s); m=2*n+1; check(0); reverse(s,s+n); check(1); reverse(v[1],v[1]+n+1); for(int i=1;i<n;++i) ans=max(ans,v[0][i]+v[1][i]); printf("%d\n",ans); } return 0;}#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int maxn=500010;const int INF=0x3f3f3f3f;char s[maxn],t[maxn];int extend1[maxn],extend2[maxn],val[30],sum[maxn],next[maxn];void getnext(char *str,int *next){ int len=strlen(str); int i=0; next[0]=len; while(i<len-1 && str[i]==str[i+1]) i++; next[1]=i; i=1; for(int k=2;k<len;k++){ int p=i+next[i]-1,L=next[k-i]; if(k+L-1>=p){ int j=max(p-k+1,0); while(k+j<len && str[k+j]==str[j]) j++; next[k]=j; i=k; }else next[k]=L; }}void EKMP(char *s,char *t,int *next,int *extend){ getnext(t,next); int slen=strlen(s),tlen=strlen(t),i=0; int minlen=min(slen,tlen); while(i<minlen && s[i]==t[i]) i++; extend[0]=i; i=0; for(int k=1;k<slen;k++){ int p=i+extend[i]-1,L=next[k-i]; if(k-1+L>=p){ int j=max(p-k+1,0); while(k+j<slen && j<tlen && s[k+j]==t[j]) j++; extend[k]=j; i=k; }else extend[k]=L; }}int main(){ //freopen("input.txt","r",stdin); int T; scanf("%d",&T); while(T--){ for(int i=0;i<26;i++) scanf("%d",&val[i]); scanf("%s",s); memset(sum,0,sizeof(sum)); int len=strlen(s); for(int i=0;s[i]!='\0';i++){ sum[i+1]=sum[i]+val[s[i]-'a']; t[i]=s[len-1-i]; } t[len]='\0'; EKMP(s,t,next,extend2); EKMP(t,s,next,extend1); int max=-INF; for(int i=0;i<len;i++){ if(i && extend1[i]+i==len){ int pos=extend1[i]; int tmp=sum[pos]; if(extend2[pos]+pos==len) tmp+=sum[len]-sum[pos]; if(tmp>max) max=tmp; }else{ int pos=i+1,tmp=0; if(extend2[pos]+pos==len) tmp+=sum[len]-sum[pos]; if(tmp>max) max=tmp; } } printf("%d\n",max); } return 0;}
- Best Reward +拓展KMP
- HDU3613:Best Reward(拓展KMP)
- HDU 3613 Best Reward ---- 拓展KMP
- Best Reward (hdu 3613 拓展KMP)
- HDU - 3613 Best Reward(KMP和拓展KMP)
- HDU 3613 Best Reward(拓展KMP求前缀回文串)
- 【KMP】 hdu3613 Best Reward
- hdu3613 Best Reward(KMP)
- HDU 3613 Best Reward(求前后缀回文 拓展KMP or Manacher)
- KMP hdu-3613-Best Reward
- 【KMP】 HDOJ 3613 Best Reward
- [扩展KMP][HDU3613][Best Reward]
- HDU 3613Best Reward(扩展KMP解法)
- Best Reward (KMP 回文串的判断)
- Best Reward (扩展KMP+回文串)
- hdu 3613 Best Reward 扩展kmp
- hdu 3613 Best Reward (kmp扩展)
- HDU 3613 Best Reward(扩展KMP)
- 行转列
- 关于输入字符问题
- OnEnable, Awake, Start order
- 面向对象基本特征
- ssh实现log4j
- Best Reward +拓展KMP
- spring注解学习资料
- 关于struts2复选框的问题
- 十六进制转换为十进制
- python复制excel
- 获得和裁剪图片
- 查看表空间
- EhCache使用详细介绍
- 一些可以查询IP地理位置、身份证所在地、手机归属地的接口