308562: CF1539B. Love Song
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Love Song
题意翻译
给你一个长为 $ n $ 的字符串和 $ q $ 个区间 $ [l,r] $ 。一个字符的值定义为其在字母表中的序号。对于每个区间,输出这个区间字符的值的总和。 $ 1 \le n,t \le 100000,1 \le l \le r \le n $ ,保证字符串中都是小写字母。题目描述
Petya once wrote a sad love song and shared it to Vasya. The song is a string consisting of lowercase English letters. Vasya made up $ q $ questions about this song. Each question is about a subsegment of the song starting from the $ l $ -th letter to the $ r $ -th letter. Vasya considers a substring made up from characters on this segment and repeats each letter in the subsegment $ k $ times, where $ k $ is the index of the corresponding letter in the alphabet. For example, if the question is about the substring "abbcb", then Vasya repeats letter 'a' once, each of the letters 'b' twice, letter 'c" three times, so that the resulting string is "abbbbcccbb", its length is $ 10 $ . Vasya is interested about the length of the resulting string. Help Petya find the length of each string obtained by Vasya.输入输出格式
输入格式
The first line contains two integers $ n $ and $ q $ ( $ 1\leq n\leq 100\,000 $ , $ 1\leq q \leq 100\,000 $ ) — the length of the song and the number of questions. The second line contains one string $ s $ — the song, consisting of $ n $ lowercase letters of English letters. Vasya's questions are contained in the next $ q $ lines. Each line contains two integers $ l $ and $ r $ ( $ 1 \leq l \leq r \leq n $ ) — the bounds of the question.
输出格式
Print $ q $ lines: for each question print the length of the string obtained by Vasya.
输入输出样例
输入样例 #1
7 3
abacaba
1 3
2 5
1 7
输出样例 #1
4
7
11
输入样例 #2
7 4
abbabaa
1 3
5 7
6 6
2 4
输出样例 #2
5
4
1
5
输入样例 #3
13 7
sonoshikumiwo
1 5
2 10
7 7
1 13
4 8
2 5
3 9
输出样例 #3
82
125
9
191
62
63
97