Codeforces Round #FF (Div. 2) 447B DZY Loves Strings
2014-07-14 17:32
633 查看
B. DZY Loves Strings
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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?
Input
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.
Output
Print a single integer — the largest possible value of the resulting string DZY could get.
Sample test(s)
input
output
Note
In the test sample DZY can obtain "abcbbc", value = 1·1 + 2·2 + 3·2 + 4·2 + 5·2 + 6·2 = 41.
AC代码:
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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?
Input
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.
Output
Print a single integer — the largest possible value of the resulting string DZY could get.
Sample test(s)
input
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
output
41
Note
In the test sample DZY can obtain "abcbbc", value = 1·1 + 2·2 + 3·2 + 4·2 + 5·2 + 6·2 = 41.
AC代码:
#include <stdio.h> #include <string.h> char s[1010]; int a[27]; int main(){ int k,i,len,max,sum; while(~scanf("%s",s)){ scanf("%d",&k); len=strlen(s); max=0; for(i=0;i<26;i++){ scanf("%d",&a[i]); if(max<a[i]) max=a[i]; } sum=0; for(i=1;i<=len+k;i++){ if(i<=len) sum+=a[s[i-1]-'a']*i; else sum+=i*max; } printf("%d\n",sum); } return 0; }
相关文章推荐
- Codeforces Round #FF (Div. 2)
- Codeforces Round #FF (Div. 2) C
- 【Codeforces Round #FF (Div. 2)】E. DZY Loves Fibonacci Numbers
- Codeforces Round #FF (Div. 1) A. DZY Loves Sequences
- Codeforces Round #FF (Div. 1) A. DZY Loves Sequences 动态规划
- Codeforces Round #FF (Div. 2) D. DZY Loves Modification 优先队列
- Codeforces Round #FF (Div. 2) B. DZY Loves Strings
- Codeforces Round #FF (Div. 2) E.DZY Loves Fibonacci Numbers
- Codeforces Round #FF (Div. 2)
- Codeforces Round #FF (Div. 1) B. DZY Loves Modification
- Codeforces Round #FF (Div. 1) A. DZY Loves Sequences 动态规划
- Codeforces Round #FF (Div. 2) A. DZY Loves Hash
- Codeforces Round #FF (Div. 2)C.DYZ Loves Sequence
- Codeforces Round #FF (Div. 二):C. DZY Loves Sequences
- Codeforces Round #FF (Div. 2) D. DZY Loves Modification 贪心+优先队列
- Codeforces Round #FF (Div. 2):B. DZY Loves Strings
- Codeforces Round #FF (Div. 1)——A贪心——DZY Loves Sequences
- Codeforces Round #FF (Div. 2):B. DZY Loves Strings
- Codeforces Round #FF(255) DIV2
- Codeforces Round #FF (Div. 2)C. DZY Loves Sequences