ow to attempt? Ruestion: he Card Game One day, Fred and his N friends were playing a card game in which each player throws a ard with a number written on it. The cards are such that a number X is written on front of ne card, and the negative of thal number is written on the back side of the card. This ame has the following rules: - Each of Ihe N players is asked to throw a card. After all the N cards are thrown, Fred has flip one or more cards in consecutive order, only once. our lask is to help Fred flip the cards in such a way that the sum of the numbers, on ront face of the cards, is the maximym. mput Specification: Input1: An integer N denoting the number of cards (1 <= N <= 500) Input2: An integer array containingN integers, where the ith integer denotes the value on the front of the card (-1000 <= input2[1)<= 1000) Dutput Specification: Return the maximum sum of the numbers, on the front of the cards
ow to attempt? Ruestion: he Card Game One day, Fred and his N friends were playing a card game in which each player throws a ard with a number written on it. The cards are such that a number X is written on front of ne card, and the negative of thal number is written on the back side of the card. This ame has the following rules: - Each of Ihe N players is asked to throw a card. After all the N cards are thrown, Fred has flip one or more cards in consecutive order, only once. our lask is to help Fred flip the cards in such a way that the sum of the numbers, on ront face of the cards, is the maximym. mput Specification: Input1: An integer N denoting the number of cards (1 <= N <= 500) Input2: An integer array containingN integers, where the ith integer denotes the value on the front of the card (-1000 <= input2[1)<= 1000) Dutput Specification: Return the maximum sum of the numbers, on the front of the cards
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...
Related questions
Question
![Example 1:
input1: 5
input2: (-2, 3, -1, -4, -2)
Output: 8
Explanation:
Since Fred can flip consecutive cards only once, he chooses to flip the last three
which results in the maximum sum (-2 +3 +1 + 4 +2), i.e., 8.
Therefore, 8 is returned as the output.
Example 2:
put1: 5
input2: (-1, 2, 3, 4, -5}
Output: 13
Explanation:
Since Fred can flip consecutive cards only once, he chooses to flip the last card,
results in the maximum sum (-1 +2 + 3 +4 +5), i.e., 13.
Therefore, 13 is returned as the output.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F133dae11-46f1-4392-a48d-a21de87c1f58%2F30c52597-a28f-4a26-967a-f603c4742914%2Fdudkl5_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Example 1:
input1: 5
input2: (-2, 3, -1, -4, -2)
Output: 8
Explanation:
Since Fred can flip consecutive cards only once, he chooses to flip the last three
which results in the maximum sum (-2 +3 +1 + 4 +2), i.e., 8.
Therefore, 8 is returned as the output.
Example 2:
put1: 5
input2: (-1, 2, 3, 4, -5}
Output: 13
Explanation:
Since Fred can flip consecutive cards only once, he chooses to flip the last card,
results in the maximum sum (-1 +2 + 3 +4 +5), i.e., 13.
Therefore, 13 is returned as the output.
![How to attempt?
Question:
The Card Game
One day, Fred and his N friends were playing a card game in which each player throws a
card with a number written on it. The cards are such that a number X is written on front of
the card, and fthe negative of that number is written on the back side of the card. This
game has the following rules: -
Each of the N players is asked to throw a card. After all the N cards are thrown, Fred has
to flip one or more cards in conseculive order, only once.
Your lask is to help Fred flip the cards in such a way that the sum of the numbers, on
front face of the cards, is the maximym.
Input Specification:
Input1: An integer N denoting the number of cards (1 <= N <= 500)
input2: An integer array containingN integers, where the ith integer
denotes the value on the front of the card (-1000<= input2[Ű<= 1000)
Output Specification:
Return the maximum sum of the numbers, on the front of the cards
Example 1:](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F133dae11-46f1-4392-a48d-a21de87c1f58%2F30c52597-a28f-4a26-967a-f603c4742914%2F70nr16m_processed.jpeg&w=3840&q=75)
Transcribed Image Text:How to attempt?
Question:
The Card Game
One day, Fred and his N friends were playing a card game in which each player throws a
card with a number written on it. The cards are such that a number X is written on front of
the card, and fthe negative of that number is written on the back side of the card. This
game has the following rules: -
Each of the N players is asked to throw a card. After all the N cards are thrown, Fred has
to flip one or more cards in conseculive order, only once.
Your lask is to help Fred flip the cards in such a way that the sum of the numbers, on
front face of the cards, is the maximym.
Input Specification:
Input1: An integer N denoting the number of cards (1 <= N <= 500)
input2: An integer array containingN integers, where the ith integer
denotes the value on the front of the card (-1000<= input2[Ű<= 1000)
Output Specification:
Return the maximum sum of the numbers, on the front of the cards
Example 1:
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY