{"categories":["PKU2008"],"published":"2006-02-03 00:00:00","description":"O(N^2)\u306e\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0 \u30cd\u30c3\u30c8\u3067\u8abf\u3079\u3066\u3044\u305f\u3089\u3001http://ace.delos.com/MAR04.green.htm\u898b\u3064\u3051\u305f\u3002 We can refine this algorithm by building things up. Suppose we fix minh and loop through the possibilities for minw in increasing order. As minw increases, the set of points satisfying the linear constraint gets strictly bigger. If w\u2026","blog_title":"\u30ab\u30e1\u30f2\u30e9\u30dc","title":"Moo University - Team Tryouts(6)","image_url":null,"blog_url":"https://ozy4dm.hateblo.jp/","author_url":"https://blog.hatena.ne.jp/Ozy/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fozy4dm.hateblo.jp%2Fentry%2F20060203%2Fp1\" title=\"Moo University - Team Tryouts(6) - \u30ab\u30e1\u30f2\u30e9\u30dc\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","url":"https://ozy4dm.hateblo.jp/entry/20060203/p1","author_name":"Ozy","type":"rich","version":"1.0","provider_url":"https://hatena.blog","height":"190","provider_name":"Hatena Blog","width":"100%"}