B. DZY Loves Strings
2014-07-19 16:47
190 查看
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.
解题说明:此题是典型的贪心,找到一个权值最大的字母,把其插入到字符串最后即可。
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<cstring>
using namespace std;
int main()
{
char s[1010];
int k,w[26],v=0,max=0;
int i,j;
scanf("%s",&s);
scanf("%d",&k);
for(i=0;i<26;i++)
{
scanf("%d",&w[i]);
if(w[i]>max)
{
max=w[i];
}
}
for(i=0;s[i]!='\0';i++)
{
v+=w[s[i]-'a']*(i+1);
}
for(j=0;j<k;i++,j++)
{
v+=max*(i+1);
}
printf("%d\n",v);
return 0;
}
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.
解题说明:此题是典型的贪心,找到一个权值最大的字母,把其插入到字符串最后即可。
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<cstring>
using namespace std;
int main()
{
char s[1010];
int k,w[26],v=0,max=0;
int i,j;
scanf("%s",&s);
scanf("%d",&k);
for(i=0;i<26;i++)
{
scanf("%d",&w[i]);
if(w[i]>max)
{
max=w[i];
}
}
for(i=0;s[i]!='\0';i++)
{
v+=w[s[i]-'a']*(i+1);
}
for(j=0;j<k;i++,j++)
{
v+=max*(i+1);
}
printf("%d\n",v);
return 0;
}
相关文章推荐
- Codeforces Round #FF (Div. 2):B. DZY Loves Strings
- B. DZY Loves Strings
- CF D. DZY Loves Strings(字符串hash 暴力)
- Codeforces Round #254 (Div. 1) D. DZY Loves Strings
- 447B. DZY Loves Strings
- Codeforces Round #FF (Div. 2/B)/Codeforces447B_ DZY Loves Strings(字符串处理)
- Codeforces Round #FF (Div. 2) B. DZY Loves Strings
- Codeforces Round #FF (Div. 2):B. DZY Loves Strings
- Codeforces Round #254 (Div. 1) D. DZY Loves Strings hash 暴力
- Codeforces Round #FF (Div. 2)B. DZY Loves Strings
- CodeForces 447B---DZY Loves Strings
- CF 447B(DZY Loves Strings-贪心)
- DZY Loves Strings
- Codeforces Round #FF (Div. 2)B. DZY Loves Strings
- CF 447B(DZY Loves Strings-贪心)
- codeforces-447B-DZY Loves Strings
- codeforces 444D DZY Loves Strings
- Codeforces Round #FF (Div. 2) Problem B DZY Loves Strings
- BZOJ 3561 DZY Loves Math VI
- BZOJ3569 DZY Loves Chinese II