You are given a series S of small English letters in length N. You are allowed (but not required) to select one index from this series and convert the letter in this index into another English character. The cost of this work is the sum of the ASCII price differences of the new character and the actual character; let's show it with an X. Next, consider the number of index pairs (i, j) in the resulting character unit (series after changing one character, or the original character unit if there is no altered character) so that 1si

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%
Program in C++ only:
You are given a series S of small English letters in length N. You are allowed (but not required) to
select one index from this series and convert the letter in this index into another English character.
The cost of this work is the sum of the ASCII price differences of the new character and the actual
character; let's show it with an X.
Next, consider the number of index pairs (i, j) in the resulting character unit (series after changing
one character, or the original character unit if there is no altered character) so that 1si <j<N and Si
<Sj. Let's show it with Y.
Find the minimum possible X + Y value.
Input
1
abcd
Output
Transcribed Image Text:Program in C++ only: You are given a series S of small English letters in length N. You are allowed (but not required) to select one index from this series and convert the letter in this index into another English character. The cost of this work is the sum of the ASCII price differences of the new character and the actual character; let's show it with an X. Next, consider the number of index pairs (i, j) in the resulting character unit (series after changing one character, or the original character unit if there is no altered character) so that 1si <j<N and Si <Sj. Let's show it with Y. Find the minimum possible X + Y value. Input 1 abcd Output
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY