You are given a convex polygon of n vertices P1, P2, .., Pn (in counter-clock or clock order). Each vertex is assigned with a weight wi. Find a subset of vertices that includes vertex 1. 1 = i1 < i2 < ... < ik sn that maximizes ratio: (dist(i1, i2) + dist(i2, i3) + ... + dist(ik, i1)) / (wi1 + wi2 +.. + wik). Where dist(i, j) refers to Euclidean distance between two points Pi, Pj. Develop a C++ code to output the maximum ratio. Sample Input: 1 00 15 29 44 20 Sample Output: 1.274755
You are given a convex polygon of n vertices P1, P2, .., Pn (in counter-clock or clock order). Each vertex is assigned with a weight wi. Find a subset of vertices that includes vertex 1. 1 = i1 < i2 < ... < ik sn that maximizes ratio: (dist(i1, i2) + dist(i2, i3) + ... + dist(ik, i1)) / (wi1 + wi2 +.. + wik). Where dist(i, j) refers to Euclidean distance between two points Pi, Pj. Develop a C++ code to output the maximum ratio. Sample Input: 1 00 15 29 44 20 Sample Output: 1.274755
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
![You are given a convex polygon of n vertices P1, P2, .., Pn (in counter-clock or clock order). Each
vertex is assigned with a weight wi. Find a subset of vertices that includes vertex 1. 1 = i1 < i2 <.. < ik
<n that maximizes ratio: (dist(i1, i2) + dist(i2, i3) + ... + dist(ik, i1)) / (wi1 + wi2 + ... + wik). Where
dist(i, j) refers to Euclidean distance between two points Pi, Pj.
Develop a C++ code to output the maximum ratio.
Sample Input:
1
3
00
15
29
4 4 20
Sample Output:
1.274755](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F481ac33e-fa90-417e-963c-978f2079edb6%2Fd93895b0-cb47-4cc3-9f9e-e66c7db3cbc7%2Fpqux0ui_processed.png&w=3840&q=75)
Transcribed Image Text:You are given a convex polygon of n vertices P1, P2, .., Pn (in counter-clock or clock order). Each
vertex is assigned with a weight wi. Find a subset of vertices that includes vertex 1. 1 = i1 < i2 <.. < ik
<n that maximizes ratio: (dist(i1, i2) + dist(i2, i3) + ... + dist(ik, i1)) / (wi1 + wi2 + ... + wik). Where
dist(i, j) refers to Euclidean distance between two points Pi, Pj.
Develop a C++ code to output the maximum ratio.
Sample Input:
1
3
00
15
29
4 4 20
Sample Output:
1.274755
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 2 steps with 1 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