DZY loves collecting special strings which only contain lowercase letters. For each lowercase letter c DZY knows its value wc. For each special string s = s1s2... s|s| (|s| is the length of the string) he represents its value with a function f(s), where
Now DZY has a string s. He wants to insert k lowercase letters into this string in order to get the largest possible value of the resulting string. Can you help him calculate the largest possible value he could get?
The first line contains a single string s (1 ≤ |s| ≤ 103).
The second line contains a single integer k (0 ≤ k ≤ 103).
The third line contains twenty-six integers from wa to wz. Each such number is non-negative and doesn't exceed 1000.
Print a single integer — the largest possible value of the resulting string DZY could get.
abc 3 1 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
41
In the test sample DZY can obtain "abcbbc", value = 1·1 + 2·2 + 3·2 + 4·2 + 5·2 + 6·2 = 41.
题目大意:给出一个字符串(小写字母)和26个小写字母的权值 在给出一个数字表示要添加的字母的数量 问添加后字符串的值最大为多少
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
int n,i,t,sum,maxn,l;
char a[1005];
int b[30];
while(cin>>a)
{
sum=0;
cin>>t;
for(i=0;i<26;i++)
cin>>b[i];
for(i=0;i<strlen(a);i++)
{
l=a[i]-'a';
sum+=b[l]*(i+1);
}
maxn=b[0];
for(i=0;i<26;i++)
if(maxn<b[i])
maxn=b[i];
for(i=strlen(a);i<strlen(a)+t;i++)
sum+=maxn*(i+1);
cout<<sum<<endl;
}
}