Problem 1916. GJam 2013 Veterans: Hedge

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This Challenge is derived from</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://code.google.com/codejam/contest/2334486/dashboard\"><w:r><w:t>Hedgemony</w:t></w:r></w:hyperlink><w:r><w:t>. This is the Large data set with N&lt;=1000.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The GJam story goes that the Baron trims the bushes(1:N) starting with bush 2 thru the next to last bush(N-1). A bush is trimmed to the average of the adjacent bushes. If the bush is less than the adjacent average the bush is left alone. Report the final Height of the next to last bush following its trimming.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input:</w:t></w:r><w:r><w:t> hin , Vector length N&lt;=1000 with values between 1 and 1000.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r><w:r><w:t> hout , Final Trimmed Height of the next to last bush (accuracy &lt;2e-4)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Examples:</w:t></w:r><w:r><w:t> [hin] [hout]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[[1 2 3 6 7] [5.000000]\n[5 8 9 9 9] [8.500000]\n[1 2 2 2 2 2] [1.937500]]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Commentary:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[1) Best Time: 7 minutes\n2) Solved by 27 of 32]]></w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

34 Solutions
17 Solvers

Last Solution submitted on Sep 15, 2021

Last 200 Solutions

Problem Comments

Problem Recent Solvers17

Problem Tags

gjam vector processing

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1916. GJam 2013 Veterans: Hedge

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers17

Suggested Problems

More from this Author255

Problem Tags

Community Treasure Hunt

Problem 1916. GJam 2013 Veterans: Hedge

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers17

Suggested Problems

More from this Author255

Problem Tags

Community Treasure Hunt

Players