CodeForces 447-B. DZY Loves String

最新推荐文章于 2026-06-23 10:43:19 发布

原创最新推荐文章于 2026-06-23 10:43:19 发布 · 466 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#codeforces #水题

CodeForces 专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一个关于字符串优化的问题：如何通过插入特定数量的小写字母来最大化字符串的价值。文章提供了完整的解析过程及代码实现，帮助读者理解算法思路。

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

$\text{[math]}$

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.

#include<stdio.h>
#include<string.h>
int main()
{
    char str[1100];
    int w[27],k;
    scanf("%s",str);
    scanf("%d",&k);
    int maxn = -99999;
    for(int i = 0;i < 26;i++){
        scanf("%d",&w[i]);
        if(w[i]>maxn)
            maxn = w[i];
    }
    int ans = 0;
    int len = strlen(str);
    for(int i = 0;i < len;i++)
    {
        ans += w[str[i]-'a']*(i+1);
    }
    for(int i = len+k;i>=len+1;i--)
    {
        ans+=maxn*i;
    }
    printf("%d\n",ans);
    return 0;
}