Ozy https://blog.hatena.ne.jp/Ozy/ カメヲラボ https://ozy4dm.hateblo.jp/ PKU2008 O(N^2)のアルゴリズム ネットで調べていたら、http://ace.delos.com/MAR04.green.htm見つけた。 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… 190 <iframe src="https://hatenablog-parts.com/embed?url=https%3A%2F%2Fozy4dm.hateblo.jp%2Fentry%2F20060203%2Fp1" title="Moo University - Team Tryouts(6) - カメヲラボ" class="embed-card embed-blogcard" scrolling="no" frameborder="0" style="display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;"></iframe> Hatena Blog https://hatena.blog 2006-02-03 00:00:00 rich https://ozy4dm.hateblo.jp/entry/20060203/p1 1.0 100%