gjam 2013 veterans: hedge -凯发k8网页登录

created by richard zapor

{"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<=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<=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 <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>"}]}

solution stats

last submitted on apr 16, 2023

last 200 solutions

problem comments

solution comments

problem recent solvers

problem tags

community treasure hunt

find the treasures in matlab central and discover how the community can help you!

start hunting!

gjam 2013 veterans: hedge -凯发k8网页登录

solution stats

last 200 solutions

problem comments

solution comments

problem recent solvers

suggested problems

more from this author

problem tags

community treasure hunt

gjam 2013 veterans: hedge -凯发k8网页登录

solution stats

last 200 solutions

problem comments

solution comments

problem recent solvers

suggested problems

more from this author

problem tags

community treasure hunt

players

wechat