{"title":"CS\u904e\u53bb\u554f\u306e\u30e1\u30e2","description":"2014computer-s1-3(4) x\u5ea7\u6a19\u304c\u6700\u5c0f\u3067\u3042\u308bQ\u306e\u8981\u7d20\u3092q0\u3068\u3059\u308b\u3002q0.x - p.x \u518d\u5e30\u3055\u305b\u308b\u3060\u3051\u306a\u306e\u3067\u3001\u6642\u9593\u8a08\u7b97\u91cf\u306fO(nlog(n))\u3068\u306a\u308b\u3002 Inner loop\u306f\u3001lower bound\u306e\u7dad\u6301\u3068break\u306b\u3088\u308bupper bound\u306b\u3088\u3063\u3066P2\u306e\u8981\u7d20\u305d\u308c\u305e\u308c\u306b\u5bfe\u3057\u3066O(1)\u3067\u52d5\u4f5c\u3059\u308b\u3002Outer\u304cO(n)\u3060\u304b\u3089O(n)\u3002 float nearestP(Point P1[], Point P2[], float lp) { int lb = 0; //P1\u306elower bound bool update; //lb\u3092\u4e00\u5ea6\u3060\u3051update\u3059\u308b\u305f\u3081\u306eflag float \u2026","published":"2014-07-16 00:00:00","height":"190","provider_url":"https://hatena.blog","author_name":"liephia","type":"rich","image_url":null,"provider_name":"Hatena Blog","width":"100%","categories":["Algorithm","Information Science"],"blog_url":"https://penzant.hatenadiary.com/","version":"1.0","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fpenzant.hatenadiary.com%2Fentry%2F2014%2F07%2F16%2F000000\" title=\"CS\u904e\u53bb\u554f\u306e\u30e1\u30e2 - Reproc.pnz\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_url":"https://blog.hatena.ne.jp/liephia/","url":"https://penzant.hatenadiary.com/entry/2014/07/16/000000","blog_title":"Reproc.pnz"}